SearcharxivSearch

arXiv · 2602.14015

On the zero-classes of monoid semi-congruences

Abstract

This paper studies the zero-classes of monoid semi-congruences, understood as internal reflexive relations on a monoid. Classical examples include normal submonoids, which arise as zero-classes of congruences, and positive cones, which are the zero-classes of preorders; both admit well-known syntactic characterizations via the Eilenberg syntactic equivalence and the syntactic preorder introduced by Pin, respectively. Beyond these cases, however, no general notion of a syntactic object characterizing zero-classes of semi-congruences, also called clots, has been established. We address this gap by introducing a syntactic relation that is reflexive and characterizes clots whenever it is compatible with the monoid operation, a property that is not automatic in contrast to the congruence and preorder settings. We further develop a hierarchy of conditions on submonoids of a given monoid that induce syntactic relations with progressively stronger properties: first ensuring compatibility with the monoid operation, and subsequently enforcing additional relational properties such as transitivity and symmetry. Several illustrative situations are discussed, including the cases of positive cones and normal submonoids.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

M. Hoefnagel, N. Martins-Ferreira, M. Sobral. 2026-02-15. On the zero-classes of monoid semi-congruences. https://arxiv.org/abs/2602.14015

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

KEEP EXPLORING

Related papers

A model structure for cartesian 2-fibrations

Cartesian 2-fibrations provide a way to understand indexed categories, but their classical ``straightening'' construction requires several layers of weak coherence data. This paper develops a homotopical framework that replaces much of this bookkeeping with a fully strict model. By using marked 2-categories to record the cartesian morphisms and 2-cells, we construct a model structure whose fibrant objects are precisely the cartesian 2-fibrations over a fixed 2-category $\mathcal{C}$. We then show that the marked Grothendieck construction identifies these 2-fibrations, up to weak equivalence, with strict 2-functors from $\mathcal{C}$ into $2\mathrm{Cat}$. As an additional contribution, we construct localizations of 2-categories that simultaneously invert selected morphisms and 2-cells.

math.CT

A Natural Fuzzy Order on Fuzzy Numbers

This paper introduces a natural fuzzy order on fuzzy numbers that extends the natural orders on real numbers and interval numbers. We investigate its completeness properties and show that the space of uniformly bounded fuzzy numbers is conically complete and conically cocomplete, and that it is complete if and only if the underlying continuous t-norm is the G\"odel t-norm. Moreover, it is proved that this space constitutes a \([0,1]\)-enriched domain if and only if the underlying continuous t-norm satisfies the (S) condition. These results provide a foundation for ordering fuzzy numbers.

math.CT

Noetherian forms of free non-symmetric operads

In this paper, we study certain categories of labeled finite rooted ordered trees over a fixed set of labels where each label is equipped with an arity: a fixed number of children that the vertex with the given label must have. Equivalently, these are expression trees for operations in a free non-symmetric operad. A morphism between these trees matches a pruning of one tree (a prefix) with an entire subtree of another (a suffix). We characterize such categories, up to isomorphism, in terms of suitable exactness properties. It turns out that these categories exhibit strong algebraic behavior, in the sense that every such category, when appended with a strict initial object, has a particularly nice noetherian form.

math.CT