Generation and decidability for periodic l-pregroups

Abstract

In [11] it is shown that the variety DLP of distributive l-pregroups is generated by a single algebra, the functional algebra F(Z) over the integers. Here, we show that DLP is equal to the join of its subvarieties LPn, for n∈Z, consisting of n-periodic l-pregroups. We also prove that every algebra in LPn embeds into the subalgebra Fn() of n-periodic elements of F(), for some integral chain ; we use this representation to show that for every n, the variety LPn is generated by the single algebra Fn(Q×Z), noting that the chain Q×Z is independent of n. We further establish a second representation theorem: every algebra in LPn embeds into the wreath product of an l-group and Fn(Z), showcasing the prominent role of the simple n-periodic l-pregroup Fn(Z). Moreover, we prove that the join of the varieties V(Fn(Z)) is also equal to DLP, hence equal to the join of the varieties LPn, even though V(Fn(Z)) is not equal to LPn for every single n. In this sense, DLP has two different well-behaved approximations. We further prove that, for every n, the equational theory of Fn(Z) is decidable and, using the wreath product decomposition, we show that the equational theory of LPn is decidable, as well.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…