SearcharxivSearch

arXiv · 2605.08099

Smith-Orbit Classification of Extensions and Exact-Sequence Asymmetry for C4*-Modules

Abstract

Let $R$ be a ring and let a $C4^{\ast}$-module mean a module all of whose submodules are $C4$-modules. We first determine its asymmetric exact-sequence behavior: kernel closure is unconditional, while explicit commutative examples disprove split-extension and cokernel closure. We then classify the finite-length torsion objects over a Dedekind domain. A primary component is $C4$ exactly when it is homocyclic, and it is $C4^{\ast}$ exactly when it is cyclic or semisimple; in finite length $C4^{\ast}$ and strongly $C4^{\ast}$ coincide. The main result is a complete orbit calculation over a discrete valuation ring $V$. Put $A=(V/(\pi^a))^r$, $C=(V/(\pi^c))^s$ and $m=\min\{a,c\}$. Then \[ \Ext^1_V(C,A)\cong \operatorname{Mat}_{r\times s}(V/(\pi^m)), \] and the $\operatorname{Aut}(A)\times\operatorname{Aut}(C)$-orbits are classified by a Smith profile $0\leq\nu_1\leq\cdots\leq\nu_q\leq m$, $q=\min\{r,s\}$. The corresponding middle term is \[ \bigoplus_{i=1}^{q} \bigl(V/(\pi^{\nu_i})\oplus V/(\pi^{a+c-\nu_i})\bigr) \oplus (V/(\pi^a))^{r-q}\oplus(V/(\pi^c))^{s-q}, \] where $V/(\pi^0)=0$. This gives exact orbit-level criteria: the middle term is $C4$ precisely for the zero orbit with $a=c$, or for an invertible square orbit with $r=s$; it is $C4^{\ast}$ precisely for the zero orbit with $a=c=1$, or for a unit scalar orbit with $r=s=1$. We reformulate the Smith data as a valuation--rank profile, determine the complete geometry and additivity of the preservation loci, and globalize the result prime by prime. Consequently every extension between arbitrary finite-length torsion $C4^{\ast}$-modules over a Dedekind domain is decided by explicit local orbit invariants.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chandrasekhar Gokavarapu. 2026-04-21. Smith-Orbit Classification of Extensions and Exact-Sequence Asymmetry for C4*-Modules. https://arxiv.org/abs/2605.08099

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