betaFeedback

WorksMathematics

Linear structure graphs associated with commuting graphs of Lie algebras

Abstract

The commuting graph (CG) of a finite-dimensional Lie algebra over a field of characteristic zero forgets the linear structure, and a non-trivial center creates redundant vertices. We introduce linear structure graphs (LSGs), whose vertices are the nonzero vectors of a vector space and whose edge set is stable under linear operations. Each vertex generates a finite ascending sequence of subspaces, which defines its LSG-height; this height governs connectivity. We characterize LSGs of height at most 1 and show that the CG of a Lie algebra with trivial center has height at most 1 if and only if the algebra is a commutative transitive Lie algebra (CTLA). The reduced commuting graph (RCG) restricts the CG to a complement of the center; it is well defined up to LSG-isomorphism, preserves the connectivity, diameter and number of components of the CG, and is compatible with direct sums. Finally, we characterize almost abelian Lie algebras (AALAs) by their RCGs.

Corresponding author: Vu A. Le. Email: [email protected].

Regarding the use of AI assistance, please refer to the declaration in Subsection 5.3.

Introduction

Associating a graph with an algebraic structure and recovering algebraic information from the combinatorial invariants of that graph has become a standard approach in modern algebra. This approach goes back to the work of Brauer and Fowler on centralizers of involutions in finite groups [6], which preceded the formal notion of commuting graphs and later played a role in the classification of finite simple groups, and to Beck’s zero-divisor graphs of commutative rings [4]. Among such graphs, the commuting graphs (CGs) occupy a central place: their vertices are the elements lying outside the center, and two distinct vertices are adjacent if and only if they commute. CGs have been studied extensively for groups, rings and matrix algebras (see, e.g., [2, 8, 10, 23]); their connectivity, diameter and clique structure reflect essential features of the underlying algebraic objects.

Much of this research is driven by the recognition problem: to what extent does the commuting graph determine the structure it comes from? For finite groups, this question has been answered in several strong forms. Abdollahi et al. [1] conjectured that every finite non-abelian simple group is determined by its non-commuting graph (the complement of the CG), and this was confirmed by Solomon and Woldar [19]. In a different direction, Giudici and Parker [12] showed that the diameters of connected commuting graphs of finite groups have no universal upper bound.

For Lie algebras, the theory is still in its early stages. In 2017, Wang and Xia [24] initiated a systematic study by introducing CGs of finite-dimensional Lie algebras. They also determined the diameters, or provided upper and lower bounds for the diameters, of these graphs for simple Lie algebras over an algebraically closed field of characteristic zero. The authors of [14] then studied CGs of a broader class of finite-dimensional Lie algebras, obtaining connectivity criteria and diameter estimates. The closed neighborhood of a vertex xx in the CG of a Lie algebra G\mathcal{G} is the centralizer of xx with the center Z(G)\mathcal{Z}(G) removed, and cliques correspond to families of pairwise commuting elements. Graph-theoretic statements about the CG thus translate into statements about the arrangement of abelian subalgebras of GG.

The recognition philosophy is native to Lie theory itself. By the Cartan–Killing classification, a semisimple Lie algebra over an algebraically closed field of characteristic zero is determined up to isomorphism by its root system (equivalently, its Cartan matrix or Dynkin diagram) and, by Serre’s theorem, can be reconstructed from these data [15]; generalized Cartan matrices lead to Kac–Moody algebras [16]. For solvable Lie algebras, however, no combinatorial data of comparable strength are available, whereas commuting graphs are defined for every Lie algebra. This motivates the following version of the recognition problem.

Main question. Which classes of finite-dimensional Lie algebras, and which of their structural invariants (e.g., the dimension of the center or the existence of abelian ideals of small codimension), can be recognized from their commuting graphs?

Unfortunately, for CGs of Lie algebras we encounter an obstacle that does not arise for finite groups. Over a field F\mathbb{F} of characteristic zero, the CG Γ(G)\Gamma(G) of a non-abelian Lie algebra has infinitely many vertices and, as an abstract graph, forgets the linear structure of GG. The loss is twofold: the center fills Γ(G)\Gamma(G) with twin vertices (two vertices differing by a central element have the same closed neighborhood), and abstract graph isomorphisms need not respect scalar multiples, sums or dimensions of subspaces.

To remove this obstacle, we retain the linear structure inside the graph itself. We introduce linear structure graphs (LSGs): graphs whose vertex set is a finite-dimensional F\mathbb{F}-vector space VV without the zero vector and whose edge set is stable under the linear operations (Definition 2.1), together with LSG-monomorphisms and LSG-isomorphisms.

Based on the framework of LSGs, this paper investigates two specific instances of this class of graphs associated with finite-dimensional Lie algebras over an arbitrary field F\mathbb{F} of characteristic zero (with the additional assumption of algebraic closure where necessary). These are referred to, respectively, as Lie algebra graphs (LAGs) and reduced commuting graphs (RCGs). From there, this paper will address, step by step, the Main question concerning specific classes of Lie algebras, namely, the class of commutative transitive Lie algebras (CTLAs) and the class of almost abelian Lie algebras (AALs).

The rest of the paper is organized as follows.

  • Section 1 collects the notation used throughout.

  • Section 2 introduces LSGs, the LSG-neighborhood of a subspace or a vertex, LSG-neighborhood sequences (Definitions 2.9 and 2.12) and LSG-height (Definition 2.14). Unlike the neighborhood sequence in a CG [14 Definition 4.1 and Theorem 4.1], the LSG-neighborhood sequence of each vertex of an nn-dimensional LSG Γ\Gamma terminates after at most n−1n-1 steps. The first main result, Theorem 1, describes the influence of the LSG-height hLSG(Γ)h_{LSG}(\Gamma) of Γ\Gamma on the structure and connectivity of the LSG Γ\Gamma. Moreover, hLSG(Γ)≤min⁡{dim⁡(Γ)−1,diam⁡(Γ)}h_{LSG}(\Gamma) \leq\min\{\dim(\Gamma)-1,\operatorname{diam}(\Gamma)\}.

  • Section 3 introduces the Lie algebra graph (LAG), a special LSG attached to a Lie algebra with trivial center. The second main result, Theorem 2, characterizes LAGs of LSG-height at most 1 as those of CTLAs (see Definition 3.4).

  • Section 4 introduces the reduced commuting graph (RCG) ΓR(G)\Gamma_R(G): the subgraph of the CG Γ(G)\Gamma(G) induced by (GR)0:=GR∖{0}(\mathcal{G}_R)_0 := \mathcal{G}_R \setminus\{0\}, where GR\mathcal{G}_R is a complementary subspace of Z(G)\mathcal{Z}(G) in GG. It removes exactly the redundancy created by the center while keeping the linear structure. The third main result, Theorem 3, demonstrates

that ΓR(G)\Gamma_R(\mathcal{G}) is well defined up to LSG-isomorphism. The fourth main result, Theorem 4, shows that ΓR(G)\Gamma_R(\mathcal{G}) is a faithful replacement for Γ(G)\Gamma(\mathcal{G}) (same connectivity, diameter and number of components). The fifth, Theorem 5, shows that ΓR(G)\Gamma_R(\mathcal{G}) is compatible with direct-sum decompositions, so it suffices to study RCGs of indecomposable Lie algebras. Following § 4, Subsection 4.3 discusses the class of AC Lie algebras (ACLAs) in Definition 4.6, which was introduced in reference [20]. Specifically, Proposition 4.8 characterizes this class by the condition that the height of the RCG is at most 1, while also describing the RCG of ACLAs. In Subsection 4.4, we provide a complete characterization of the RCGs of the class of AALAs (see Definition 4.9) in Theorem 6, the sixth main result of the paper. This result shows that the property of being almost abelian is determined by the LSG-height and LSG-dimension of the RCG.

  • Section 5, titled “Conclusion, open problems and declaration of AI use”, summarizes the main results of the paper; introduces Open problems 1, 2 and 3, and provide a declaration of AI use in Subsection 5.3.

Preliminaries

We use the following notation throughout.

  • F\mathbb{F} is a field of characteristic zero and F0:=F∖{0}\mathbb{F}_0 := \mathbb{F} \setminus\{0\}. For n∈N0:=N∖{0}n \in\mathbb{N}_0 := \mathbb{N} \setminus\{0\}, Fn\mathbb{F}^n is the nn-dimensional F\mathbb{F}-vector space and (e1,…,en)(e_1,\ldots,e_n) is the standard basis of V=FnV = \mathbb{F}^n, F0n:=Fn∖{0}\mathbb{F}_0^n := \mathbb{F}^n \setminus\{0\} (00 is the zero vector).

  • For any F\mathbb{F}-vector space VV, the subscript 0 always means that the zero vector is removed: V0:=V∖{0}V_0 := V \setminus\{0\}. We write W≤VW \leq V if WW is a subspace of VV, and W<VW < V if WW is a proper subspace of VV, i.e. W≤VW \leq V and W≠VW \neq V.

  • Suppose that G\mathcal{G}, G′\mathcal{G}', H\mathcal{H}, ⋯\cdots are Lie algebras over F\mathbb{F}. We write H≤LieG\mathcal{H} \leq_{\mathrm{Lie}} \mathcal{G} when H\mathcal{H} is a subalgebra of G\mathcal{G}, and H<LieG\mathcal{H} <_{\mathrm{Lie}} \mathcal{G} if H\mathcal{H} is a proper subalgebra of G\mathcal{G}, i.e. H≤LieG\mathcal{H} \leq_{\mathrm{Lie}} \mathcal{G} and H≠G\mathcal{H} \neq\mathcal{G}. The symbol I◃GI \triangleleft\mathcal{G} means that II is an ideal of G\mathcal{G}. We write f ⁣:G↪LieG′f \colon\mathcal{G} \hookrightarrow_{\mathrm{Lie}} \mathcal{G}' (resp., f ⁣:G↠LieG′f \colon\mathcal{G} \twoheadrightarrow_{\mathrm{Lie}} \mathcal{G}' or f ⁣:G→∼LieG′f \colon\mathcal{G} \xrightarrow{\sim}_{\mathrm{Lie}} \mathcal{G}') to mean that ff is a Lie monomorphism (resp., Lie epimorphism or Lie isomorphism).

  • The symbol span⁡{x,y,…}\operatorname{span}\{x,y,\ldots\} is always the span of an arbitrary subset {x,y,…}\{x,y,\ldots\} in VV. For v∈V0v \in V_0 we have span⁡{v}∖{0}=F0v\operatorname{span}\{v\} \setminus\{0\} = \mathbb{F}_0v.

  • Unless otherwise stated, the term “vector space” means a non-trivial finite-dimensional F\mathbb{F}-vector space, “Lie algebra” means a finite-dimensional non-abelian Lie algebra over F\mathbb{F}. For a given Lie algebra, when listing its Lie brackets, it is always understood that any omitted Lie brackets are trivial. G⊕LieG′\mathcal{G} \oplus_{\mathrm{Lie}} \mathcal{G}' is the direct sum of Lie algebras, and G:=Fn⊕DFe0\mathcal{G} := \mathbb{F}^n \oplus_D \mathbb{F}e_0 is the semidirect sum of Fn\mathbb{F}^n and Fe0\mathbb{F}e_0 induced by a non-trivial D∈Der⁡(Fn)≅gln(F)D \in\operatorname{Der}(\mathbb{F}^n) \cong\mathfrak{gl}_n(\mathbb{F}), i.e. e0∉Fne_0 \notin\mathbb{F}^n, [e0,v]:=D(v)∈Fn[e_0,v] := D(v) \in\mathbb{F}^n for all v∈Fnv \in\mathbb{F}^n.

Basic notions on graphs

Unless otherwise specified, “graph” means a simple, undirected graph; it may be infinite (see [5, 9, 25] for background).

Definition 1.1. Let Γ=(VΓ,EΓ)\Gamma= (V_{\Gamma}, E_{\Gamma}) be a graph with the vertex set VΓ≠∅V_{\Gamma} \neq\varnothing and the edge set EΓ⊆{{x,y}∣x,y∈VΓ,x≠y}E_{\Gamma} \subseteq\{\{x,y\} \mid x,y \in V_{\Gamma}, x \neq y\}. Assume that S\mathcal{S} is a non-empty subset of VΓV_{\Gamma}.

(1) Two vertices x,yx,y are adjacent if x=yx=y or {x,y}∈EΓ\{x,y\}\in E_{\Gamma}. The neighborhood of xx is N(x):={y∈VΓ∣x,y adjacent}N(x):=\{y\in V_{\Gamma}\mid x,y\text{ adjacent}\}. So, s∈N(s)s\in N(s) for every vertex s∈VΓs\in V_{\Gamma}.

(2) Γ\Gamma is called complete if every pair of vertices is adjacent.

(3) The subgraph of Γ\Gamma induced by S\mathcal{S}, denoted by ΓS=(VS,ES)\Gamma_{\mathcal{S}}=(V_{\mathcal{S}},E_{\mathcal{S}}), is the graph defined as follows: VS:=SV_{\mathcal{S}}:=\mathcal{S}, ES:={{x,y}∈EΓ∣x,y∈S}E_{\mathcal{S}}:=\{\{x,y\}\in E_{\Gamma}\mid x,y\in\mathcal{S}\}.

(4) S\mathcal{S} is called a clique in Γ\Gamma if the subgraph ΓS\Gamma_{\mathcal{S}} induced by S\mathcal{S} is complete.

(5) A path of length dd (d∈N0d\in\mathbb{N}_0) joining u,vu,v is a sequence u=v0,v1,…,vd=vu=v_0,v_1,\ldots,v_d=v of vertices with {vi,vi+1}∈EΓ\{v_i,v_{i+1}\}\in E_{\Gamma}, i=0,…,d−1i=0,\ldots,d-1. Two vertices are connected if they coincide or are joined by a path.

(6) S\mathcal{S} is called a connected subset if any two of its vertices are connected. The graph Γ\Gamma is connected if its vertex set is connected.

(7) The maximal connected subset (in the sense of inclusion) that contains the vertex ss is called the connected component of ss, denoted by CC(s)CC(s).

(8) The distance function dist⁡Γ:VΓ×VΓ→N∪{+∞}\operatorname{dist}_{\Gamma}:V_{\Gamma}\times V_{\Gamma}\to\mathbb{N}\cup\{+\infty\} is defined as

dist⁡Γ(x,y):={0,if x=y,d≥1,if x≠y and d is the length of a shortest path joining them,+∞,if x≠y and they are not connected.\operatorname{dist}_{\Gamma}(x,y):= \begin{cases} 0, & \text{if }x=y,\\ d\geq1, & \text{if }x\ne y\text{ and }d\text{ is the length of a shortest path joining them},\\ +\infty, & \text{if }x\ne y\text{ and they are not connected.} \end{cases}

(9) The diameter diam⁡(Γ)\operatorname{diam}(\Gamma) of Γ\Gamma is defined as

diam⁡(Γ):={sup⁡{dist⁡Γ(u,v)∣u,v∈VΓ}∈N∪{+∞},if Γ is connected,+∞,otherwise.\operatorname{diam}(\Gamma):= \begin{cases} \sup\{\operatorname{dist}_{\Gamma}(u,v)\mid u,v\in V_{\Gamma}\}\in\mathbb{N}\cup\{+\infty\}, & \text{if }\Gamma\text{ is connected},\\ +\infty, & \text{otherwise.} \end{cases}

Definition 1.2. Let Γi=(Vi,Ei)\Gamma_i=(V_i,E_i) (i=1,2i=1,2) be graphs. A map f:V1→V2f:V_1\to V_2 is a full homomorphism if for all distinct $u,v\in V_1:

{u,v}∈E1⟺[f(u)=f(v)∨{f(u),f(v)}∈E2].\{u,v\}\in E_1\Longleftrightarrow[f(u)=f(v)\lor\{f(u),f(v)\}\in E_2].

An injective (resp. surjective, bijective) full homomorphism is a monomorphism (resp. epimorphism, isomorphism). Any monomorphism is an isomorphism onto its image.

The commuting graph of a Lie algebra

References

  1. [1]Abdollahi, A., Akbari, S., Majmami, H. R. (2006). Non-commuting graph of a group. J. Algebra 298(2): 468–492. doi:10.1016/j.jalgebra.2006.02.015.DOI
  2. [2]Akbari, S., Bidkhori, H., Mohammadian, A. (2008). Commuting graphs of matrix algebras. Comm. Algebra 36(11): 4020–4031. doi:10.1080/00927870802174538.DOI
  3. [3]Avetisyan, Z. (2022). The structure of almost abelian Lie algebras. Internat. J. Math. 33(8): 2250057. doi:10.1142/S0129167X22500574.DOI
  4. [4]Beck, I. (1988). Coloring of commutative rings. J. Algebra 116(1): 208–226. doi:10.1016/0021-8693(88)90202-5.DOI
  5. [5]Bondy, J. A., Murty, U. S. R. (1976). Graph Theory with Applications. New York: American Elsevier; London: Macmillan.
  6. [6]Brauer, R., Fowler, K. A. (1955). On groups of even order. Ann. of Math. (2) 62(3): 565–583. doi:10.2307/1970080.DOI
  7. [7]Burde, D., Ceballos, M. (2012). Abelian ideals of maximal dimension for solvable Lie algebras. J. Lie Theory 22(3): 741–756. doi:10.5802/jlt.689.arxiv.org/abs/0911.2995
  8. [8]Cao M. N., Mai H. B., and Bui X. H. (2025). On diameters of commuting graphs of matrix algebras over division rings. J. Algebra Appl. 24(6): 2550148. doi:10.1142/S0219498825501488.
  9. [9]Diestel, R. (2017). Graph Theory, 5th ed. Graduate Texts in Mathematics, Vol. 173. Berlin: Springer.
  10. [10]Dorbidi, H. R. (2025). The diameter of commuting graph of matrix ring of division rings. J. Algebra Appl. 24(5): 2550121. doi:10.1142/S021949882550121X.
  11. [11]Gein, A. G. (1976). Semimodular Lie algebras. Siberian Math. J. 17(2): 189–193. Translated from Sibirsk. Mat. Zh. 17(2): 243–248. doi:10.1007/BF00967564.DOI
  12. [12]Giudici, M., Parker, C. (2013). There is no upper bound for the diameter of the commuting graph of a finite group. J. Combin. Theory Ser. A 120(7): 1600–1603. doi:10.1016/j.jcta.2013.05.008.DOI
  13. [13]Gorbatsevich, V. V. (2017). Lie algebras with abelian centralizers. Math. Notes 101(5–6): 795–801. doi:10.1134/S0001434617050054.DOI
  14. [14]Hieu V. Ha, Hoa Q. Duong, Vu A. Le, and Tuyen T. M. Nguyen (2026). Diameter of commuting graphs of Lie algebras. J. Algebra Appl., in press, Paper No. 2750205. doi:10.1142/S0219498827502057.DOI
  15. [15]Humphreys, J. E. (1972). Introduction to Lie Algebras and Representation Theory. Graduate Texts in Mathematics, Vol. 9. New York: Springer-Verlag.DOI
  16. [16]Kac, V. G. (1990). Infinite-Dimensional Lie Algebras, 3rd ed. Cambridge: Cambridge University Press.
  17. [17]Klep, I., Moravec, P. (2010). Lie algebras with abelian centralizers. Algebra Colloq. 17(4): 629–636. doi:10.1142/S100538671000060X.DOI
  18. [18]Kolman, B. (1965). Semi-modular Lie algebras. J. Sci. Hiroshima Univ. Ser. A-I Math. 29(2): 149–163. doi:10.32917/hmj/1206139231.DOI
  19. [19]Solomon, R. M., Woldar, A. J. (2013). Simple groups are characterized by their non-commuting graphs. J. Group Theory 16(6): 793–824. doi:10.1515/jgt-2013-0021.DOI
  20. [20]Sriwongsa Songpon (2025). Non-commuting graphs of projective spaces over central quotients of lie algebras. Preprint, arXiv:2505.00726.arxiv.org/abs/2505.00726
  21. [21]Vu A. Le, Hai T. T. Cao, Hoa Q. Duong, Tuan A. Nguyen & Thieu N. Vo (2022). On the problem of classifying solvable Lie algebras having small codimensional derived algebras. Comm. Algebra 50(9): 3775–3793. doi:10.1080/00927872.2022.2045302.DOI
  22. [22]Vu A. Le, Hoa Q. Duong, Tuan A. Nguyen (2025). Complete and cocomplete Lie algebras with injective and projective properties. Preprint, arXiv:2511.12531.arxiv.org/abs/2511.12531
  23. [23]Miguel, C. (2016). On the diameter of the commuting graph of the matrix ring over a centrally finite division ring. Linear Algebra Appl. 509: 276–285. doi:10.1016/j.laa.2016.08.001.DOI
  24. [24]Wang, D., Xia, C. (2017). Diameters of the commuting graphs of simple Lie algebras. J. Lie Theory 27(1): 139–154. doi:10.5802/jolt.937.DOI
  25. [25]West, D. B. (2001). Introduction to Graph Theory, 2nd ed. Upper Saddle River, NJ: Prentice Hall.

Paper details

vlnc:W_57a6nfqr
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Claude Opus 5.5, Claude Fable 5.1 (bare)

View statement
Looking for related papers…
Contents