SearcharxivSearch

arXiv · 1509.06042

Retractions of free MV-algebras and unital $\ell$-groups

Abstract

A number of papers deal with the problem of counting the number of retractions of a structure $S$ onto a substructure $T.$ In the particular case when $S$ is a free algebra, this number is $\geq 1$ iff $T$ is projective. In this paper we consider the case when $T$ is a projective lattice-ordered abelian group with a distinguished strong order unit, or equivalently, a projective MV-algebra. Let $A$ be a retract of the free $n$-generator MV-algebra $\mathcal{M}([0,1]^n)$ of McNaughton functions on $[0,1]^n$. We prove that the number $\mathsf{r}(A)$ of retractions of $\mathcal{M}([0,1]^n)$ onto $A$ is finite if, and only if, the maximal spectral space $\mu_A$ is homeomorphic to a (Kuratowski) closed domain $M$ of $[0,1]^n$, in the sense that $M=\mathsf{cl}(\mathsf{int}(M))$. Further, the closed domain condition is decidable and $\mathsf{r}(A)$ is computable, once a retraction onto $A$ is explicitly given. Thus every finitely generated projective MV-algebra $B$ comes equipped with a new invariant $\iota(B)=\sup\{\mathsf{r}(A) \mid \mbox{$A\cong B$ for $A$ a retract of $\mathcal{M}([0,1]^{k})$} \},$ where $k$ is the smallest number of generators of $B$. We compute $\iota(B)$ for many projective MV-algebras $B$ considered in the literature. Various problems concerning retractions of free MV-algebras are shown to be decidable. Via the $\Gamma$ functor, our results and computations automatically transfer to finitely generated projective abelian $\ell$-groups with a distinguished strong unit.

Explore related subjects

Keep this discovery

BibTeXRIS

L. M. Cabrer, D. Mundici. 2015-09-20. Retractions of free MV-algebras and unital $\ell$-groups. https://arxiv.org/abs/1509.06042

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