SearcharxivSearch

arXiv · 2101.09484

Ideal ring extensions and trusses

Abstract

It is shown that there is a close relationship between ideal extensions of rings and trusses, that is, sets with a semigroup operation distributing over a ternary abelian heap operation. Specifically, a truss can be associated to every element of an extension ring that projects down to an idempotent in the extending ring; every weak equivalence of extensions yields an isomorphism of corresponding trusses. Furthermore, equivalence classes of ideal extensions of rings by integers are in one-to-one correspondence with associated trusses up to isomorphism given by a translation. Conversely, to any truss $T$ and an element of this truss one can associate a ring and its extension by integers in which $T$ is embedded as a truss. Consequently any truss can be understood as arising from an ideal extension by integers. The key role is played by interpretation of ideal extensions by integers as extensions defined by double homothetisms of Redei [L.\ Redei, Die Verallgemeinerung der Schreierschen Erweiterungstheorie, {\em Acta Sci.\ Math.\ Szeged}, {\bf 14} (1952), 252--273] or by self-permutable bimultiplications of Mac Lane [S.\ Mac Lane, Extensions and obstructions for rings, {\em Illinois J.\ Math.} {\bf 2} (1958), 316--345], that is, as {\em integral homothetic extensions}. It is shown that integral homothetic extensions of trusses are universal as extensions of trusses to rings but still enjoy a particular smallness property: they do not contain any subrings to which the truss inclusion map corestricts. Minimal extensions of trusses into rings are defined. The correspondence between homothetic ring extensions and trusses is used to classify fully up to isomorphism trusses arising from rings with zero multiplication and rings with trivial annihilators.

Explore related subjects

Keep this discovery

BibTeXRIS

Ryszard R. Adruszkiewicz, Tomasz Brzeziński, Bernard Rybołowicz. 2021-01-23. Ideal ring extensions and trusses. https://arxiv.org/abs/2101.09484

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