SearcharxivSearch

arXiv · 2609.05148

Explicit Super-Linear Algebra over K[{\theta}1, {\theta}2]: A General Berezinian Correction Formula and Multiplicativity Theorem for Arbitrary Block Size

Abstract

We study super-matrices $M_{m|n}(R)$ over the rank-two exterior algebra $R=K[\theta_1,\theta_2]/(\theta_1^2,\theta_2^2,\theta_1\theta_2+\theta_2\theta_1)$, the smallest supercommutative ring on which the Berezinian's odd-by-odd correction term $BD^{-1}C$ need not vanish. We recall that the supertrace satisfies graded cyclicity, $\mathrm{str}(XY)=(-1)^{|X||Y|}\mathrm{str}(YX)$, so $\mathrm{str}([A,B])=0$ for even $A,B$, and that an explicit $1|1$ matrix over $R$ has $BD^{-1}C\neq0$ surviving to second order in the odd generators. We then prove the extension anticipated in the $1|1$ note: a closed-form Berezinian formula for arbitrary even $X\in M_{m|n}(R)$, $m,n\geq1$ (Theorem 1), given through a single $m\times m$ matrix pairing $\Delta$ built from the odd blocks of $X$; and a fully general multiplicativity theorem $\mathrm{Ber}(XY)=\mathrm{Ber}(X)\mathrm{Ber}(Y)$ for even invertible $X,Y\in M_{m|n}(R)$ (Theorem 2), proved by an explicit trace-cyclicity cancellation. Both results specialize exactly to the known $1|1$ formulas when $m=n=1$, and we verify them on a worked $m=2,n=1$ example. We extend the framework from two to an arbitrary number $r\geq2$ of odd generators, replacing the scalar pairing $\Delta$ by a $\Lambda^2(V)$-valued pairing on the $r$-dimensional space $V$ of odd generators, and identify this pairing, in the scalar case, with a Pl\"ucker coordinate of the odd off-diagonal data. We close with a discussion of related work of Khudaverdian--Voronov, and a remark identifying $\Delta$ as a matrix-valued contraction against the natural alternating pairing on the space of odd generators.

Explore related subjects

Keep this discovery

BibTeXRIS

Devichandrika V. 2026-09-04. Explicit Super-Linear Algebra over K[{\theta}1, {\theta}2]: A General Berezinian Correction Formula and Multiplicativity Theorem for Arbitrary Block Size. https://doi.org/10.3842/sigma.2025.***

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