SearcharxivSearch

arXiv · 2607.17231

The group $\mathrm{TK}_1$ of graded and valued division algebras

Abstract

For a division algebra $D$, let $K_1(D) = D^*/[D^*, D^*]$ and let $\operatorname{TK}_1(D)$ be the torsion subgroup of the abelian group $K_1(D)$. We study this torsion group for graded and valued division algebras, in parallel with the known theory of $\operatorname{SK}_1$. For a graded division algebra $E$ finite-dimensional over its center, we give exact sequences describing $\operatorname{TK}_1(E)$ in terms of $E_0$, the grade group~$\Gamma_E$, and the conjugation action of $E^*$ on $E_0$. These yield explicit formulas for $\operatorname{TK}_1(E)$ in the unramified, totally ramified, and semiramified cases. For a tame valued division algebra $D$ over its Henselian-valued center $K$, we identify the obstruction group $\mathbf H$ to a congruence theorem for $\TK(D)$. We show that if the residue field~$\overline K$ of the valuation on $K$ has characteristic $p > 0$, then $\mathbf H \cong\mu_K[p]$, the $p$-primary component of the group $\mu_K$ of roots of unity in $K$; but if $\operatorname{char}(\overline K)=0$, then $\mathbf H=1$. We further prove a short exact sequence $$ 1\,\longrightarrow \,\mathbf H\, \longrightarrow \,\operatorname{TK}_1(D)\, \longrightarrow\, \operatorname{TK}_1(\gr(D))\, \longrightarrow \,1, $$ where $\gr(D)$ is the associated graded division algebra determined by the valuation on $D$ obtained from the valuation on $K$. We also prove a stability theorem for a graded division algebra $E$ with quotient division ring~$q(E)$, i.e., $$ \operatorname{TK}_1(E)\,\cong \,\operatorname{TK}_1(q(E)), $$ together with a new proof of the corresponding stability theorem for $\operatorname{SK}_1$. As applications, we obtain graded analogues of Motiee's primary decomposition and scalar-extension results for torsion Whitehead groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Huynh Viet Khanh, Nguyen Duc Anh Khoa, Adrian R. Wadsworth. 2026-07-19. The group $\mathrm{TK}_1$ of graded and valued division algebras. https://arxiv.org/abs/2607.17231

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