SearcharxivSearch

arXiv · 2512.07836

Lie Theory Theorems over Positive Characteristic and Modular Lie algebras

Abstract

Sometimes, it is very important to consider what type of setting is assumed when studying a mathematical object. For example, in Galois theory, properties can completely change if we study a field extension over $F_p$ instead of a field over $\mathbb{Q}$. When we consider base fields for modules, algebras, or vector spaces, we often recall commonly used fields such as $\mathbb{C}$ and fields $F$ with char $F= p$. Similar behavior arises in the study of Lie algebras. Properties that hold for Lie algebras over a field of characteristic zero do not necessarily hold over a field of characteristic $p$. In general, we are more familiar with studying Lie algebras and their representations over $\mathbb{C}$. However, an interesting fact is that new properties can be discovered by studying the theory over fields of positive characteristic. Therefore, we will closely examine how theorems and properties in Lie algebra theory do not hold or behave differently when the base field has characteristic p. In fact, there is a related area of study known as modular Lie theory that deals specifically with this setting. In this theory, we study concepts such as the definition of restricted Lie algebras, that is, Lie algebras $L$ equipped with a p-mapping $[p] : L \rightarrow L$, defined as $x\mapsto x^{[p]}$, where the base field has prime characteristic. In other words, the theory introduces a new tool, the $p$-mapping, for the study of modular Lie algebras. In this project, we aim to study Lie algebras defined over fields of positive characteristic. Specifically, the main focus will be on how Lie algebras behave over such fields and how we can develop the general framework of modular Lie theory based on the insights and structures that arise in this setting.

Explore related subjects

Keep this discovery

BibTeXRIS

Eun H. Park. 2025-11-04. Lie Theory Theorems over Positive Characteristic and Modular Lie algebras. https://arxiv.org/abs/2512.07836

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA