Profinite Monads, Profinite Equations, and Reiterman's Theorem

2015/11/06 by Chen, Liang-Ting, Adamek, Jiri, Milius, Stefan +1 · 1 citation
#Category Theory (math.CT) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL)

paper · doi:10.48550/arxiv.1511.02147

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.

Cited by

• Demystifying Codensity Monads via Duality

Related

• Reiterman's Theorem on Finite Algebras for a Monad
• Profinite topologies
• Extending maps to profinite completions in finitely generated\n quasivarieties
• Visibly Pushdown Languages and Free Profinite Algebras
• Finite coproducts, coregularity and coexactness for profinite interior algebras