Congruence formations yield regular-language formations
ProvedHJMEilenberg.congruence_to_languagesLet be finite and let be a formation of finite-index congruences for an -sorted signature . There exists a regular-language formation whose languages over every sorted variable family are exactly
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.
import Definitions.Def_HJMEilenberg_Formations
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 HJMEilenbergRead-back
What the Lean code literally says, in plain math · gpt-5
For every implicitly quantified type of sorts equipped with a typeclass witness that is finite (with allowed), every implicitly quantified -sorted signature —meaning that for each finite list of input sorts and each output sort , is an arbitrary type of operation symbols, with no finiteness or nonemptiness assumption—and every finite-index congruence formation for , there exists a regular-language formation for , not asserted to be unique, such that for every -indexed family of types , including families having empty or infinite components, the selected languages are exactly , where is the many-sorted term algebra generated by variables from and applications of symbols of , a language is a family , and a congruence is a family of equivalence relations preserved by every basic operation. Here the assumption that is a finite-index congruence formation literally supplies, for every , a nonempty set of such congruences; closure of under intersection; upward closure under inclusion of the componentwise relations; closure under pullback along every homomorphism for which, at every sort , the map onto is surjective; and, for each selected , finiteness of the disjoint union . The asserted witness must itself carry all the structure required of a regular-language formation: every has finite-index syntactic congruence, where means that every congruence containing every congruence that saturates relates and ; every language saturated by the universal congruence belongs to ; whenever , every language saturated by the intersection of their syntactic congruences also belongs to ; and whenever , is quotient-surjective at every sort with respect to the syntactic congruence of , and is saturated by the pullback of that congruence along , then . If a sort’s relevant carrier is empty, the corresponding elementwise conditions are vacuous; if , all sort-indexed conditions are vacuous and every disjoint union used in the finite-index condition is empty and hence finite.
Confirmed by the mission captain (proposal self-audit).