Finitely many clones contain a near-unanimity operation
OpenFunctionAlgebras.finite_clones_nuclone-theoryconstraint-satisfactiongalois-connectionnear-unanimityuniversal-algebra
is a finite set and . The set of clones on (families containing all projections and closed under composition) that contain a -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 FunctionAlgebrasSource
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 be a finite set and fixed. The collection of all families , , such that contains all projections, is closed under composition, and some satisfies for every position of and all , is a finite set.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.