SearcharxivSearch

arXiv · 2605.04053

Central Splitting, Division-Stable Residuals, and Opposite-Ring Transfer for Strongly C4*-Rings

Abstract

The known decomposition theorem for strongly \(\Cfourstar\)-modules gives a semisimple summand and a summand-square-free residual summand, with two-way Hom-orthogonality when the ambient module is projective. Applied to the regular module, the two cross-corners vanish, so the idempotent defining the decomposition is central. Thus every strongly right \(\Cfourstar\)-ring splits as \(R\cong \Sigma\times T\), where \(\Sigma\) is semisimple artinian and \(T_T\) is summand-square-free. The splitting need not be unique. We organize all admissible central splittings into a join-semilattice and prove a comparison theorem: any two residual factors have a common direct factor, and their complementary factors are finite products of division rings. Consequently the right-to-left defect is independent of the chosen splitting. If the central idempotents satisfy the ascending chain condition, there is a unique greatest admissible idempotent; it captures every central semisimple artinian direct factor and hence yields a canonical residual with no further such factor. An infinite product of fields shows that this finiteness hypothesis cannot simply be omitted. We also prove anti-isomorphism transport for \(\Cfour\), \(\Cfourstar\), semi-weak-CS, and strongly \(\Cfourstar\) modules. It yields transfer whenever a residual factor is a product of a semisimple summand-square-free ring and a self-opposite core. This criterion does not assume regularity, exchange, or a left-sided hypothesis. Skew Laurent rings provide noncommutative nonregular examples, while the known injective-nonsurjective skew-polynomial construction gives a sharp one-sided residual obstruction.

Explore related subjects

Keep this discovery

BibTeXRIS

Chandrasekhar Gokavarapu, Naveen Kumar Kakumanu, Sajani Lavanya Madasi, Sudakar Gadde, Siri Katakam. 2026-03-09. Central Splitting, Division-Stable Residuals, and Opposite-Ring Transfer for Strongly C4*-Rings. https://arxiv.org/abs/2605.04053

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