Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pol is a clone and Inv is a co-clone

Open
FunctionAlgebras.pol_isClone_inv_isRelClone

by Alien60 · Nov 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

clone-theoryconstraint-satisfactiongalois-connectionnear-unanimityuniversal-algebra

AAA is a set. For every family of relations QQQ on AAA, Pol Q\mathrm{Pol}\,QPolQ (the operations of every arity n≥0n\ge0n≥0 preserving every relation of QQQ) is a clone. For every family of operations FFF on AAA, Inv F\mathrm{Inv}\,FInvF (the relations preserved by every operation of FFF) is a relational clone: it contains every relation definable by a primitive positive formula ∃yˉ ⋀jRj(… )∧⋀l(ul=vl)\exists\bar y\,\bigwedge_j R_j(\dots)\wedge\bigwedge_l(u_l=v_l)∃yˉ​⋀j​Rj​(…)∧⋀l​(ul​=vl​) with all RjR_jRj​ in Inv F\mathrm{Inv}\,FInvF.

Preamble
import Definitions.Def_FunctionAlgebras_defs

universe u
Formal statement
namespace FunctionAlgebras

variable {A : Type u}

/-- Lau, *Function Algebras on Finite Sets*, Part II, Theorem 2.6.2.  For every family of
relations `Q`, the set `Pol Q` of its polymorphisms is a clone, and for every family of
operations `F`, the set `Inv F` of its invariant relations is a relational clone (co-clone). -/
theorem pol_isClone_inv_isRelClone (Q : ∀ h : ℕ, Set (Set (Fin h → A)))
    (F : ∀ n : ℕ, Set ((Fin n → A) → A)) :
    IsClone (Pol Q) ∧ IsRelClone (Inv F) := by sorry

end FunctionAlgebras
Source
D. Lau, Function Algebras on Finite Sets, Springer Monographs in Mathematics, 2006, https://doi.org/10.1007/3-540-36023-9, Part II, Theorem 2.6.2
Read-back

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

For every set AAA (no finiteness), every family of relations QQQ and every family of operations FFF, both of the following hold. (i) The family Pol(Q)\mathrm{Pol}(Q)Pol(Q) of operations preserving all relations of QQQ contains every projection and is closed under composition x↦f(g0(x),…,gn−1(x))x\mapsto f(g_0(x),\dots,g_{n-1}(x))x↦f(g0​(x),…,gn−1​(x)). (ii) The family Inv(F)\mathrm{Inv}(F)Inv(F) of relations preserved by all operations of FFF is closed under primitive positive definability: any relation defined by an existential conjunction of atoms (each an application of a relation of Inv(F)\mathrm{Inv}(F)Inv(F) to variables) and equalities of variables, with hhh free and kkk existential variables, belongs to Inv(F)h\mathrm{Inv}(F)_hInv(F)h​.

Human review
  • Endorsed by Shuze Chen · Nov 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Alien60 · Nov 7, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me