Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Finite-index congruences form a filter

Proved
HJMEilenberg.finiteIndex_filter

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

congruenceseilenberg-theoremformal-languagesmany-sorted-algebra

Let SSS be a finite sort type, Σ\SigmaΣ an SSS-sorted signature, and AAA a Σ\SigmaΣ-algebra. The universal congruence on AAA has finite index; the intersection of any two finite-index congruences has finite index; and every congruence above a finite-index congruence has finite index.

Equivalently, the finite-index congruences form a filter in the congruence order. This supplies the finiteness closure needed in both formation constructions.

Preamble
import Definitions.Def_HJMEilenberg_Formations
Formal statement
namespace HJMEilenberg

open MSKleene

/-- Proposition 6.7: finite-index congruences form a filter. -/
theorem finiteIndex_filter {S : Type} [Finite S] {sig : Signature S}
    (A : Algebra sig) :
    Congruence.FiniteIndex (Congruence.top A) ∧
      (∀ Phi Psi : Congruence A,
        Phi.FiniteIndex → Psi.FiniteIndex →
          (Congruence.inter Phi Psi).FiniteIndex) ∧
      (∀ Phi Psi : Congruence A,
        Phi.FiniteIndex → Phi ≤ Psi → Psi.FiniteIndex) := 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 immediately following the definition of finite-index congruence.
Read-back

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

For every type SSS of sorts equipped with a finiteness instance (with no nonemptiness assumption), every SSS-sorted signature Σ\SigmaΣ—that is, an arbitrary family of types Σ(w,s)\Sigma(w,s)Σ(w,s) of operation symbols indexed by every finite list www of input sorts and output sort sss, with no finiteness restriction on the operation-symbol types—and every Σ\SigmaΣ-algebra AAA, consisting of carrier types AsA_sAs​ (which may be empty or infinite) and an interpretation Aw→AsA_w\to A_sAw​→As​ for every symbol of rank (w,s)(w,s)(w,s), the following three assertions hold simultaneously: (i) the universal congruence ⊤A\top_A⊤A​, which relates every pair of elements within each sort, has finite index; (ii) for every two congruences Φ,Ψ\Phi,\PsiΦ,Ψ on AAA, if each has finite index, then their intersection Φ∩Ψ\Phi\cap\PsiΦ∩Ψ, whose relation at sort sss is x (Φ∩Ψ)s y  ⟺  (x Φs y ∧ x Ψs y)x\,(\Phi\cap\Psi)_s\,y\iff(x\,\Phi_s\,y\ \land\ x\,\Psi_s\,y)x(Φ∩Ψ)s​y⟺(xΦs​y ∧ xΨs​y), has finite index; and (iii) for every two congruences Φ,Ψ\Phi,\PsiΦ,Ψ on AAA, if Φ\PhiΦ has finite index and Φ≤Ψ\Phi\leq\PsiΦ≤Ψ, meaning that for every sort sss and all x,y∈Asx,y\in A_sx,y∈As​, x Φs yx\,\Phi_s\,yxΦs​y implies x Ψs yx\,\Psi_s\,yxΨs​y, then Ψ\PsiΨ has finite index. Here a congruence is, at every sort, an equivalence relation preserved componentwise by every basic operation of AAA, and “Φ\PhiΦ has finite index” means literally that the total disjoint union ∐s:S(As/Φs)\coprod_{s:S}(A_s/{\Phi_s})∐s:S​(As​/Φs​) of all sortwise quotient types is finite. Thus the quantified implications are vacuously satisfied whenever their antecedent finite-index conditions fail; SSS may be empty, in which case every such disjoint union is empty, and a carrier AsA_sAs​ may itself be empty, in which case its quotient contributes no element, whereas under ⊤A\top_A⊤A​ an inhabited carrier contributes exactly one quotient class.

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