SearcharxivSearch

arXiv · 0903.1746

Representation of artinian partially ordered sets over semiartinian Von Neumann regular algebras

Abstract

If $R$ is a semiartinian Von Neumann regular ring, then the set $\Prim_{R}$ of primitive ideals of $R$, ordered by inclusion, is an artinian poset in which all maximal chains have a greatest element. Moreover, if $\Prim_{R}$ has no infinite antichains, then the lattice $\BL_{2}(R)$ of all ideals of $R$ is anti-isomorphic to the lattice of all upper subsets of $\Prim_{R}$. Since the assignment $U\mapsto r_R(U)$ defines a bijection from any set $\Simp_R$ of representatives of simple right $R$-modules to $\Prim_{R}$, a natural partial order is induced in $\Simp_R$, under which the maximal elements are precisely those simple right $R$-modules which are finite dimensional over the respective endomorphism division rings; these are always $R$-injective. Given any artinian poset $I$ with at least two elements and having a finite cofinal subset, a lower subset $I'\sbs I$ and a field $D$, we present a construction which produces a semiartinian and unit-regular $D$-algebra $D_I$ having the following features: (a) $\Simp_{D_I}$ is order isomorphic to $I$; (b) the assignment $H\mapsto\Simp_{D_I/H}$ realizes an anti-isomorphism from the lattice $\BL_{2}(D_I)$ to the lattice of all upper subsets of $\Simp_{D_I}$; (c) a non-maximal element of $\Simp_{D_I}$ is injective if and only if it corresponds to an element of $I'$, thus $D_I$ is a right $V$-ring if and only if $I' = I$; (d) $D_I$ is a right \emph{and} left $V$-ring if and only if $I$ is an antichain; (e) if $I$ has finite dual Krull length, then $D_I$ is (right and left) hereditary; (f) if $I$ is at most countable and $I' = \vu$, then $D_I$ is a countably dimensional $D$-algebra.

Explore related subjects

Keep this discovery

BibTeXRIS

Giuseppe Baccella. 2009-11-08. Representation of artinian partially ordered sets over semiartinian Von Neumann regular algebras. https://arxiv.org/abs/0903.1746

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