Every co-clone is Inv Pol of itself
OpenFunctionAlgebras.inv_pol_eqclone-theoryconstraint-satisfactiongalois-connectionnear-unanimityuniversal-algebra
is a finite set. Let be a relational clone on : a family of relations containing every relation definable by a primitive positive formula with . Then , where includes nullary operations.
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.9.2 (Bodnarčuk–Kalužnin–Kotov–
Romov; Geiger). On a finite set, every relational clone (co-clone) is the set of invariant
relations of its polymorphisms: `Q = Inv Pol Q`. -/
theorem inv_pol_eq [Finite A] (Q : ∀ h : ℕ, Set (Set (Fin h → A))) (hQ : IsRelClone Q) :
Inv (Pol Q) = Q := 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 2.9.2 (Bodnarcuk-Kaluznin-Kotov-Romov 1969; Geiger 1968)
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Let be a finite set and a family of relations () closed under primitive positive definability: whenever is a formula with and free variables, the relation it defines lies in . Let be the -ary operations preserving every relation in every , and the set of all preserved by every operation (of any arity, including ) in . Then for every .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.