Every clone is Pol Inv of itself
OpenFunctionAlgebras.pol_inv_eqis a set; operations are maps (). is a clone: it contains all projections and is closed under composition . If is finite, then .
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.1. On a finite set, every
clone is the set of polymorphisms of its invariant relations: `C = Pol Inv C`. -/
theorem pol_inv_eq [Finite A] (C : ∀ n : ℕ, Set ((Fin n → A) → A)) (hC : IsClone C) :
Pol (Inv C) = C := 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.1
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Let be a finite set and a family of operations on containing all projections and closed under composition. Let be all preserved by every operation of every arity in , and the -ary operations preserving every such , for every . Then for every .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.