arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.09478math.CTmath.RA
收藏

弱 Mal'tsev 簇的语法刻画

A syntactic characterization of weakly Mal'tsev varieties

Nadja Egner, Pierre-Alain Jacqmin, Nelson Martins-Ferreira

AI总结:

本文给出了弱 Mal'tsev 簇的语法刻画,并将其应用于分配格簇,同时刻画了正则自反关系均为等价关系的簇。

摘要:

弱 Mal'tsev 范畴的概念由第三作者于2008年引入,是经典 Mal'tsev 范畴概念的推广。众所周知,一个泛代数簇是 Mal'tsev 范畴当且仅当其理论具有 Mal'tsev 项。在本文的主定理中,我们证明了弱 Mal'tsev 范畴的簇的语法刻画。我们将结果应用于分配格簇,该簇此前已知是弱 Mal'tsev 范畴。根据 Z. Janelidze 和第三作者的结果,一个有限完备范畴是弱 Mal'tsev 的当且仅当任何内部强自反关系都是等价关系。在本文的最后部分,我们给出了那些任何正则自反关系都是等价关系的簇的语法刻画。

英文摘要:

The notion of a weakly Mal'tsev category, as it was introduced in 2008 by the third author, is a generalization of the classical notion of a Mal'tsev category. It is well-known that a variety of universal algebras is a Mal'tsev category if and only if its theory admits a Mal'tsev term. In the main theorem of this paper, we prove a syntactic characterization of the varieties that are weakly Mal'tsev categories. We apply our result to the variety of distributive lattices which was known to be a weakly Mal'tsev category before. By a result of Z. Janelidze and the third author, a finitely complete category is weakly Mal'tsev if and only if any internal strong reflexive relation is an equivalence relation. In the last part of this paper, we give a syntactic characterization of those varieties in which any regular reflexive relation is an equivalence relation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑