Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2203.10987

Annihilator ideals of graph algebras

Lia Vas
View original source ↗Read source document ↗Export metadata ↓

Abstract

If $I$ is a (two-sided) ideal of a ring $R$, we let $\operatorname{ann}_l(I)=\{r\in R\mid rI=0\},$ $\operatorname{ann}_r(I)=\{r\in R\mid Ir=0\},$ and $\operatorname{ann}(I)=\operatorname{ann}_l(I)\cap \operatorname{ann}_r(I)$ be the left, the right and the double annihilators. An ideal $I$ is said to be an annihilator ideal if $I=\operatorname{ann}(J)$ for some ideal $J$ (equivalently, $\operatorname{ann}(\operatorname{ann}(I))=I$). We study annihilator ideals of Leavitt path algebras and graph $C^*$-algebras. Let $L_K(E)$ be the Leavitt path algebra of a graph $E$ over a field $K.$ If $I$ is an ideal of $L_K(E),$ it has recently been shown that $\operatorname{ann}(I)$ is a graded ideal (with respect to the natural grading of $L_K(E)$ by $\mathbb Z$). We note that $\operatorname{ann}_l(I)$ and $\operatorname{ann}_r(I)$ are also graded. For a graded ideal $I,$ we describe $\operatorname{ann}(I)$ in terms of the properties of a pair of sets of vertices of $E,$ known as an admissible pair, which naturally corresponds to $I.$ Using such a description, we present properties of $E$ which are equivalent with the requirement that each graded ideal of $L_K(E)$ is an annihilator ideal. We show that the same properties of $E$ are also equivalent with each of the following conditions: (1) The lattice of graded ideals of $L_K(E)$ is a Boolean algebra; (2) Each closed gauge-invariant ideal of $C^*(E)$ is an annihilator ideal; (3) The lattice of closed gauge-invariant ideals of $C^*(E)$ is a Boolean algebra. In addition, we present properties of $E$ which are equivalent with each of the following conditions: (1) Each ideal of $L_K(E)$ is an annihilator ideal; (2) The lattice of ideals of $L_K(E)$ is a Boolean algebra; (3) Each closed ideal of $C^*(E)$ is an annihilator ideal; (4) The lattice of closed ideals of $C^*(E)$ is a Boolean algebra.

Explore related subjects

math.RAmath.OA

Keep this discovery

BibTeXRIS

Lia Vas. 2022-03-21. Annihilator ideals of graph algebras. https://arxiv.org/abs/2203.10987

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗