Pol is a clone and Inv is a co-clone
OpenFunctionAlgebras.pol_isClone_inv_isRelCloneis a set. For every family of relations on , (the operations of every arity preserving every relation of ) is a clone. For every family of operations on , (the relations preserved by every operation of ) is a relational clone: it contains every relation definable by a primitive positive formula with all in .
import Definitions.Def_FunctionAlgebras_defs universe u
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 FunctionAlgebrasRead-back
What the Lean code literally says, in plain math · claude-opus-5-5
For every set (no finiteness), every family of relations and every family of operations , both of the following hold. (i) The family of operations preserving all relations of contains every projection and is closed under composition . (ii) The family of relations preserved by all operations of is closed under primitive positive definability: any relation defined by an existential conjunction of atoms (each an application of a relation of to variables) and equalities of variables, with free and existential variables, belongs to .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.