Table of Contents
Fetching ...

Primitivity Testing in Free Group Algebras via Duality

Matan Seidel, Danielle Ernst-West, Doron Puder

TL;DR

This work addresses primitivity and related extension problems in free group algebras by introducing a duality, called $Q$-duality, between extensions of column and row spaces over a free ideal ring. The double $Q$-dual yields the algebraic closure, providing concrete criteria to decide freeness versus algebraicity and enabling explicit algorithms for computing algebraic closures, testing algebraicity, and testing primitivity-like properties for extensions of free $K\left[F\right]$-modules and, via augmentation ideals, for extensions of free groups. Central technical advances include the invariant $\phi_{I,J}(N)$ under duality and a natural rank-preserving involution in the $(w-1)$ case, together with a practical algorithmic toolkit built on Rosenmann’s algorithm for right ideals. The framework also delivers an intersection algorithm for free modules and translates to efficient procedures for free-group extensions, connecting to word measures and highlighting potential computational applications in algorithmic group theory and representation-theoretic contexts.

Abstract

Let $K$ be a field and $F$ a free group. By a classical result of Cohn and Lewin, the free group algebra $K\left[F\right]$ is a free ideal ring (FIR): a ring over which the submodules of free modules are themselves free, and of a well-defined rank. Given a finitely generated right ideal $I\leq K\left[F\right]$ and an element $f\in I$, we give an explicit algorithm determining whether $f$ is part of some basis of $I$. More generally, given free $K[F]$-modules $M\le N$, we provide algorithms determining whether $M$ is a free summand of $N$, and whether $N$ admits a free splitting relative to $M$. These can also be used to obtain analogous algorithms for free groups $H\le J$. As an aside, we also provide an algorithm to compute the intersection of two given submodules of a free $K\left[F\right]$-module. A key feature of this work is the introduction of a duality, induced by a matrix with entries in a free ideal ring, between the respective algebraic extensions of its column and row spaces.

Primitivity Testing in Free Group Algebras via Duality

TL;DR

This work addresses primitivity and related extension problems in free group algebras by introducing a duality, called -duality, between extensions of column and row spaces over a free ideal ring. The double -dual yields the algebraic closure, providing concrete criteria to decide freeness versus algebraicity and enabling explicit algorithms for computing algebraic closures, testing algebraicity, and testing primitivity-like properties for extensions of free -modules and, via augmentation ideals, for extensions of free groups. Central technical advances include the invariant under duality and a natural rank-preserving involution in the case, together with a practical algorithmic toolkit built on Rosenmann’s algorithm for right ideals. The framework also delivers an intersection algorithm for free modules and translates to efficient procedures for free-group extensions, connecting to word measures and highlighting potential computational applications in algorithmic group theory and representation-theoretic contexts.

Abstract

Let be a field and a free group. By a classical result of Cohn and Lewin, the free group algebra is a free ideal ring (FIR): a ring over which the submodules of free modules are themselves free, and of a well-defined rank. Given a finitely generated right ideal and an element , we give an explicit algorithm determining whether is part of some basis of . More generally, given free -modules , we provide algorithms determining whether is a free summand of , and whether admits a free splitting relative to . These can also be used to obtain analogous algorithms for free groups . As an aside, we also provide an algorithm to compute the intersection of two given submodules of a free -module. A key feature of this work is the introduction of a duality, induced by a matrix with entries in a free ideal ring, between the respective algebraic extensions of its column and row spaces.

Paper Structure

This paper contains 21 sections, 31 theorems, 8 equations, 13 algorithms.

Key Result

Theorem 1.2

Given an extension $M\leq N$ of finitely generated $K\left[F\right]$-submodules of $K\left[F\right]^{m}$ for some $m\in\mathbb{Z}_{\geq1}$, there exist algorithms for computing the extension's algebraic closure (Algorithm alg: Get-Algebraic-Free), and consequently for testing if the extension is alg

Theorems & Definitions (46)

  • Definition 1.1
  • Theorem 1.2
  • Theorem 1.3
  • Theorem 1.4
  • Theorem 1.5
  • Definition 1.6
  • Theorem 1.7
  • Example 1.8
  • Proposition 2.1
  • Proposition 2.2
  • ...and 36 more