Eilenberg theorem for many-sorted formations
ProvedHJMEilenberg.eilenberg_formation_theoremLet be finite and an -sorted signature. There exists an order isomorphism
from finite-index congruence formations to regular-language formations. For every congruence formation , its image selects exactly the languages saturated by some congruence in ; for every language formation , the inverse image selects exactly the finite-index congruences all of whose saturated languages lie in .
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.
import Definitions.Def_HJMEilenberg_Formations
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 HJMEilenbergRead-back
What the Lean code literally says, in plain math · gpt-5
For every implicitly quantified type equipped with the assumption that has finitely many elements, and for every explicitly given -sorted signature (assigning a type of operation symbols to each finite list of input sorts and each output sort), there exists an order isomorphism from the poset of finite-index congruence formations for to the poset of regular-language formations for . Here an -sorted set is an arbitrary family of types , is the -sorted algebra of finite -terms with variables from , a congruence on is a sortwise family of equivalence relations compatible with every basic operation, and it has finite index when the disjoint union is finite. A finite-index congruence formation assigns to every a set of congruences on such that is nonempty, is closed under sortwise intersection, is upward closed under inclusion of congruence relations, is closed under pulling a selected congruence on back along any homomorphism for which is surjective at every sort , and contains only finite-index congruences. A language on is a sortwise family of subsets, and a congruence saturates a language when, for every sort and every -equivalent pair, membership in is equivalent. The syntactic congruence of relates of sort exactly when every congruence that contains every congruence saturating also relates ; is regular exactly when this congruence has finite index. A regular-language formation assigns to every a set of languages on such that every selected language is regular, every language saturated by the universal congruence is selected, whenever two languages are selected every language saturated by the intersection of their syntactic congruences is selected, and whenever , has sortwise-surjective composite into the quotient by the syntactic congruence of , and a language on is saturated by the pullback of that syntactic congruence along , then . Both posets are ordered by pointwise inclusion of the selected sets, so 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 and every -sorted set , ; and, independently, for every regular-language formation and every -sorted set , . The quantifiers include the degenerate cases where is empty, where any component is empty or infinite, and where has no operation symbols or infinitely many of them; no nonemptiness condition on or the components of , and no finiteness condition on or , is assumed.
Confirmed by the mission captain (proposal self-audit).