Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Congruence formations yield regular-language formations

Proved
HJMEilenberg.congruence_to_languages

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

congruenceseilenberg-theoremformal-languagesmany-sorted-algebra

Let SSS be finite and let F\mathfrak FF be a formation of finite-index congruences for an SSS-sorted signature Σ\SigmaΣ. There exists a regular-language formation L\mathcal LL whose languages over every sorted variable family XXX are exactly

L(X)=LF(X)={L∣∃Φ∈F(X), L is Φ-saturated}.\mathcal L(X)=\mathcal L_{\mathfrak F}(X) =\{L\mid \exists\Phi\in\mathfrak F(X),\ \text{$L$ is $\Phi$-saturated}\}.L(X)=LF​(X)={L∣∃Φ∈F(X), L is Φ-saturated}.

This states that the paper's congruence-to-language construction satisfies all regular-language formation axioms, with equality at every free algebra rather than only an abstract existence claim.

Preamble
import Definitions.Def_HJMEilenberg_Formations
Formal statement
namespace HJMEilenberg

open MSKleene

/-- Proposition 6.21: a finite-index congruence formation determines a
formation of regular languages by saturation. -/
theorem congruence_to_languages {S : Type} [Finite S] {sig : Signature S}
    (F : FiniteIndexCongruenceFormation sig) :
    ∃ L : RegularLanguageFormation sig,
      ∀ X : SSet S, L.languages X = languagesOf F 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, Proposition Cong2LangEnFinit, together with Proposition Cong2LangBasic.
Read-back

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

For every implicitly quantified type of sorts SSS equipped with a typeclass witness that SSS is finite (with S=∅S=\varnothingS=∅ allowed), every implicitly quantified SSS-sorted signature Σ\SigmaΣ—meaning that for each finite list www of input sorts and each output sort sss, Σ(w,s)\Sigma(w,s)Σ(w,s) is an arbitrary type of operation symbols, with no finiteness or nonemptiness assumption—and every finite-index congruence formation FFF for Σ\SigmaΣ, there exists a regular-language formation L\mathcal LL for Σ\SigmaΣ, not asserted to be unique, such that for every SSS-indexed family of types X=(Xs)s∈SX=(X_s)_{s\in S}X=(Xs​)s∈S​, including families having empty or infinite components, the selected languages are exactly L(X)={K∣∃Φ, Φ∈F(X) and ∀s ∀x,y∈TΣ(X)s, xΦsy⇒(x∈Ks↔y∈Ks)}\mathcal L(X)=\{K\mid \exists\Phi,\ \Phi\in F(X)\ \text{and}\ \forall s\,\forall x,y\in T_\Sigma(X)_s,\ x\mathrel{\Phi_s}y\Rightarrow(x\in K_s\leftrightarrow y\in K_s)\}L(X)={K∣∃Φ, Φ∈F(X) and ∀s∀x,y∈TΣ​(X)s​, xΦs​y⇒(x∈Ks​↔y∈Ks​)}, where TΣ(X)T_\Sigma(X)TΣ​(X) is the many-sorted term algebra generated by variables from XXX and applications of symbols of Σ\SigmaΣ, a language KKK is a family Ks⊆TΣ(X)sK_s\subseteq T_\Sigma(X)_sKs​⊆TΣ​(X)s​, and a congruence Φ\PhiΦ is a family of equivalence relations Φs\Phi_sΦs​ preserved by every basic operation. Here the assumption that FFF is a finite-index congruence formation literally supplies, for every XXX, a nonempty set F(X)F(X)F(X) of such congruences; closure of F(X)F(X)F(X) under intersection; upward closure under inclusion of the componentwise relations; closure under pullback along every homomorphism f:TΣ(X)→TΣ(Y)f:T_\Sigma(X)\to T_\Sigma(Y)f:TΣ​(X)→TΣ​(Y) for which, at every sort sss, the map x↦[fs(x)]Θsx\mapsto[f_s(x)]_{\Theta_s}x↦[fs​(x)]Θs​​ onto TΣ(Y)s/ΘsT_\Sigma(Y)_s/{\Theta_s}TΣ​(Y)s​/Θs​ is surjective; and, for each selected Φ\PhiΦ, finiteness of the disjoint union ∑s∈STΣ(X)s/Φs\sum_{s\in S}T_\Sigma(X)_s/{\Phi_s}∑s∈S​TΣ​(X)s​/Φs​. The asserted witness L\mathcal LL must itself carry all the structure required of a regular-language formation: every K∈L(X)K\in\mathcal L(X)K∈L(X) has finite-index syntactic congruence, where x≡Kyx\equiv_K yx≡K​y means that every congruence Ψ\PsiΨ containing every congruence that saturates KKK relates xxx and yyy; every language saturated by the universal congruence belongs to L(X)\mathcal L(X)L(X); whenever K,M∈L(X)K,M\in\mathcal L(X)K,M∈L(X), every language saturated by the intersection of their syntactic congruences also belongs to L(X)\mathcal L(X)L(X); and whenever M∈L(Y)M\in\mathcal L(Y)M∈L(Y), f:TΣ(X)→TΣ(Y)f:T_\Sigma(X)\to T_\Sigma(Y)f:TΣ​(X)→TΣ​(Y) is quotient-surjective at every sort with respect to the syntactic congruence of MMM, and KKK is saturated by the pullback of that congruence along fff, then K∈L(X)K\in\mathcal L(X)K∈L(X). If a sort’s relevant carrier is empty, the corresponding elementwise conditions are vacuous; if S=∅S=\varnothingS=∅, all sort-indexed conditions are vacuous and every disjoint union used in the finite-index condition is empty and hence finite.

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