Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Every clone is Pol Inv of itself

Open
FunctionAlgebras.pol_inv_eq

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

AAA is a set; operations are maps An→AA^n\to AAn→A (n≥0n\ge0n≥0). C=(Cn)nC=(C_n)_nC=(Cn​)n​ is a clone: it contains all projections and is closed under composition f(g0,…,gn−1)f(g_0,\dots,g_{n-1})f(g0​,…,gn−1​). If AAA is finite, then Pol Inv C=C\mathrm{Pol}\,\mathrm{Inv}\,C=CPolInvC=C.

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 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 2.9.1
Read-back

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

Let AAA be a finite set and C=(Cn)nC=(C_n)_nC=(Cn​)n​ a family of operations on AAA containing all projections and closed under composition. Let Inv(C)h\mathrm{Inv}(C)_hInv(C)h​ be all R⊆AhR\subseteq A^hR⊆Ah preserved by every operation of every arity ≥0\ge0≥0 in CCC, and Pol(Inv C)n\mathrm{Pol}(\mathrm{Inv}\,C)_nPol(InvC)n​ the nnn-ary operations preserving every such RRR, for every h∈Nh\in\mathbb Nh∈N. Then Pol(Inv C)n=Cn\mathrm{Pol}(\mathrm{Inv}\,C)_n=C_nPol(InvC)n​=Cn​ for every nnn.

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