Profinite Monads, Profinite Equations, and Reiterman's Theorem
Liang-Ting Chen, Jiri Adamek, Stefan Milius, Henning Urbat

TL;DR
This paper generalizes Reiterman's theorem to finite Eilenberg-Moore algebras for a monad T, showing that pseudovarieties can be characterized by profinite equations across various algebraic structures.
Contribution
It extends Reiterman's theorem to a broader class of finite algebras using profinite equations, applicable to diverse algebraic categories.
Findings
Reiterman's theorem is generalized to finite T-algebras.
Finite quasivarieties are characterized by profinite implications.
Applicable to finite ordered algebras, categories, and infinity-monoids.
Abstract
Profinite equations are an indispensable tool for the algebraic classification of formal languages. Reiterman's theorem states that they precisely specify pseudovarieties, i.e. classes of finite algebras closed under finite products, subalgebras and quotients. In this paper Reiterman's theorem is generalised to finite Eilenberg-Moore algebras for a monad T on a variety D of (ordered) algebras: a class of finite T-algebras is a pseudovariety iff it is presentable by profinite (in-)equations. As an application, quasivarieties of finite algebras are shown to be presentable by profinite implications. Other examples include finite ordered algebras, finite categories, finite infinity-monoids, etc.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · Rough Sets and Fuzzy Logic · semigroups and automata theory
