English

Generation and decidability for periodic l-pregroups

Logic 2024-03-11 v1

Abstract

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

Cite

@article{arxiv.2403.05099,
  title  = {Generation and decidability for periodic l-pregroups},
  author = {Nikolaos Galatos and Isis A. Gallardo},
  journal= {arXiv preprint arXiv:2403.05099},
  year   = {2024}
}
R2 v1 2026-06-28T15:13:14.529Z