Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finitely many clones contain a near-unanimity operation

Open
FunctionAlgebras.finite_clones_nu

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

clone-theoryconstraint-satisfactiongalois-connectionnear-unanimityuniversal-algebra

AAA is a finite set and d≥2d\ge2d≥2. The set of clones on AAA (families C=(Cn)n≥0C=(C_n)_{n\ge0}C=(Cn​)n≥0​ containing all projections and closed under composition) that contain a (d+1)(d+1)(d+1)-ary near-unanimity operation is finite.

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 8.3.1 (second clause).  On a finite
set, for fixed `d ≥ 2` there are only finitely many clones containing a `(d+1)`-ary
near-unanimity operation. -/
theorem finite_clones_nu [Finite A] {d : ℕ} (hd : 2 ≤ d) :
    {C : ∀ n : ℕ, Set ((Fin n → A) → A) |
      IsClone C ∧ ∃ m ∈ C (d + 1), IsNearUnanimity m}.Finite := 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 8.3.1 (second clause)
Read-back

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

Let AAA be a finite set and d≥2d\ge2d≥2 fixed. The collection of all families C=(Cn)n∈NC=(C_n)_{n\in\mathbb N}C=(Cn​)n∈N​, Cn⊆(An→A)C_n\subseteq(A^n\to A)Cn​⊆(An→A), such that CCC contains all projections, is closed under composition, and some m∈Cd+1m\in C_{d+1}m∈Cd+1​ satisfies m(x,…,x,y,x,…,x)=xm(x,\dots,x,y,x,\dots,x)=xm(x,…,x,y,x,…,x)=x for every position of yyy and all x,yx,yx,y, is a finite set.

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