Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Eilenberg theorem for many-sorted formations

Proved
HJMEilenberg.eilenberg_formation_theorem

by Cosme · Sep 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

congruenceseilenberg-theoremformal-languagesmany-sorted-algebra

Let SSS be finite and Σ\SigmaΣ an SSS-sorted signature. There exists an order isomorphism

Form⁡Cgrfi(Σ)≃oForm⁡Langr(Σ)\operatorname{Form}_{\mathrm{Cgr}_{\mathrm{fi}}}(\Sigma) \simeq_o \operatorname{Form}_{\mathrm{Lang}_{r}}(\Sigma)FormCgrfi​​(Σ)≃o​FormLangr​​(Σ)

from finite-index congruence formations to regular-language formations. For every congruence formation F\mathfrak FF, its image selects exactly the languages saturated by some congruence in F\mathfrak FF; for every language formation L\mathcal LL, the inverse image selects exactly the finite-index congruences all of whose saturated languages lie in L\mathcal LL.

The displayed pointwise equalities fix the order isomorphism to be the two constructions of the paper, rather than an arbitrary equivalence between the underlying ordered types.

Preamble
import Definitions.Def_HJMEilenberg_Formations
Formal statement
namespace HJMEilenberg

open MSKleene

/-- Proposition 6.23: the complete lattices of finite-index congruence
formations and regular-language formations are isomorphic. The displayed
equalities fix the isomorphism to be exactly the two maps defined in the
paper. -/
theorem eilenberg_formation_theorem {S : Type} [Finite S]
    (sig : Signature S) :
    ∃ e : FiniteIndexCongruenceFormation sig ≃o
        RegularLanguageFormation sig,
      (∀ (F : FiniteIndexCongruenceFormation sig) (X : SSet S),
        (e F).languages X = languagesOf F X) ∧
      (∀ (L : RegularLanguageFormation sig) (X : SSet S),
        (e.symm L).congruences X = congruencesOf L X) := by
  sorry

end HJMEilenberg
Source
Juan Climent Vidal and Enric Cosme Llópez, Eilenberg theorems for many-sorted formations, Houston Journal of Mathematics 45(2) (2019), Section 6, pp. 351–416; arXiv:1604.04792. The free-term substrate is cross-checked against the companion TeX source A Kleene theorem for free many-sorted algebras. Section 6, final proposition: the complete lattices of finite-index congruence formations and regular-language formations are isomorphic.
Read-back

What the Lean code literally says, in plain math · gpt-5

For every implicitly quantified type SSS equipped with the assumption that SSS has finitely many elements, and for every explicitly given SSS-sorted signature Σ\SigmaΣ (assigning a type of operation symbols to each finite list of input sorts and each output sort), there exists an order isomorphism eee from the poset of finite-index congruence formations for Σ\SigmaΣ to the poset of regular-language formations for Σ\SigmaΣ. Here an SSS-sorted set XXX is an arbitrary family of types (Xs)s∈S(X_s)_{s\in S}(Xs​)s∈S​, TΣ(X)T_\Sigma(X)TΣ​(X) is the SSS-sorted algebra of finite Σ\SigmaΣ-terms with variables from XXX, a congruence on TΣ(X)T_\Sigma(X)TΣ​(X) is a sortwise family of equivalence relations compatible with every basic operation, and it has finite index when the disjoint union ∐s∈STΣ(X)s/Φs\coprod_{s\in S}T_\Sigma(X)_s/{\Phi_s}∐s∈S​TΣ​(X)s​/Φs​ is finite. A finite-index congruence formation FFF assigns to every XXX a set FXF_XFX​ of congruences on TΣ(X)T_\Sigma(X)TΣ​(X) such that FXF_XFX​ is nonempty, is closed under sortwise intersection, is upward closed under inclusion of congruence relations, is closed under pulling a selected congruence Θ\ThetaΘ on TΣ(Y)T_\Sigma(Y)TΣ​(Y) back along any homomorphism f:TΣ(X)→TΣ(Y)f:T_\Sigma(X)\to T_\Sigma(Y)f:TΣ​(X)→TΣ​(Y) for which x↦[fs(x)]Θsx\mapsto[f_s(x)]_{\Theta_s}x↦[fs​(x)]Θs​​ is surjective at every sort sss, and contains only finite-index congruences. A language on TΣ(X)T_\Sigma(X)TΣ​(X) is a sortwise family of subsets, and a congruence Φ\PhiΦ saturates a language KKK when, for every sort and every Φ\PhiΦ-equivalent pair, membership in KKK is equivalent. The syntactic congruence of KKK relates x,yx,yx,y of sort sss exactly when every congruence Ψ\PsiΨ that contains every congruence saturating KKK also relates x,yx,yx,y; KKK is regular exactly when this congruence has finite index. A regular-language formation LLL assigns to every XXX a set LXL_XLX​ of languages on TΣ(X)T_\Sigma(X)TΣ​(X) such that every selected language is regular, every language saturated by the universal congruence is selected, whenever two languages K,NK,NK,N are selected every language saturated by the intersection of their syntactic congruences is selected, and whenever M∈LYM\in L_YM∈LY​, f:TΣ(X)→TΣ(Y)f:T_\Sigma(X)\to T_\Sigma(Y)f:TΣ​(X)→TΣ​(Y) has sortwise-surjective composite into the quotient by the syntactic congruence of MMM, and a language KKK on TΣ(X)T_\Sigma(X)TΣ​(X) is saturated by the pullback of that syntactic congruence along fff, then K∈LXK\in L_XK∈LX​. Both posets are ordered by pointwise inclusion of the selected sets, so eee is a bijection whose forward and inverse maps preserve and reflect that order. Moreover, the two displayed conjuncts fix its action exactly: for every finite-index congruence formation FFF and every SSS-sorted set XXX, (eF)X={K∣∃Φ, Φ∈FX and Φ saturates K}(eF)_X=\{K\mid \exists\Phi,\ \Phi\in F_X\ \text{and}\ \Phi\text{ saturates }K\}(eF)X​={K∣∃Φ, Φ∈FX​ and Φ saturates K}; and, independently, for every regular-language formation LLL and every SSS-sorted set XXX, (e−1L)X={Φ∣Φ has finite index and every language saturated by Φ lies in LX}(e^{-1}L)_X=\{\Phi\mid \Phi\text{ has finite index and every language saturated by }\Phi\text{ lies in }L_X\}(e−1L)X​={Φ∣Φ has finite index and every language saturated by Φ lies in LX​}. The quantifiers include the degenerate cases where SSS is empty, where any component XsX_sXs​ is empty or infinite, and where Σ\SigmaΣ has no operation symbols or infinitely many of them; no nonemptiness condition on SSS or the components of XXX, and no finiteness condition on XXX or Σ\SigmaΣ, is assumed.

Human review
  • Endorsed by Shuze Chen · Sep 9, 2026

  • Endorsed by Cosme · Sep 9, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me