Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Local-to-global interpolation

Open
FunctionAlgebras.local_interpolation

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

clone-theoryconstraint-satisfactiongalois-connectionnear-unanimityuniversal-algebra

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​). CCC contains a (d+1)(d+1)(d+1)-ary near-unanimity operation mmm, i.e. m(x,…,x,y,x,…,x)=xm(x,\dots,x,y,x,\dots,x)=xm(x,…,x,y,x,…,x)=x for every position of yyy, where d≥2d\ge2d≥2. Let n≥1n\ge1n≥1, fff an nnn-ary partial function and D⊆AnD\subseteq A^nD⊆An a finite set (its domain). If for every E⊆DE\subseteq DE⊆D with ∣E∣≤d|E|\le d∣E∣≤d some p∈Cnp\in C_np∈Cn​ agrees with fff on EEE, then some p∈Cnp\in C_np∈Cn​ agrees with fff on all of DDD.

Preamble
import Definitions.Def_FunctionAlgebras_defs

universe u
Formal statement
namespace FunctionAlgebras

variable {A : Type u}

/-- Baker–Pixley (1975), Theorem 2.1, (1) ⇒ (4), for the clone `C` of term operations of an
algebra on `A` (Lau, proof of Theorem 8.3.1, step II).  If `C` contains a `(d+1)`-ary
near-unanimity operation (`d ≥ 2`), then a finite partial `n`-ary function `f` with domain `D`
is interpolated on `D` by a member of `C` as soon as its restriction to every subset of `D` with
at most `d` elements is. -/
theorem local_interpolation (C : ∀ n : ℕ, Set ((Fin n → A) → A)) (hC : IsClone C) {d : ℕ}
    (hd : 2 ≤ d) (m : (Fin (d + 1) → A) → A) (hm : m ∈ C (d + 1)) (hnu : IsNearUnanimity m)
    {n : ℕ} (hn : 0 < n) (f : (Fin n → A) → A) (D : Finset (Fin n → A))
    (hloc : ∀ E ⊆ D, E.card ≤ d → Interpolates C f ↑E) :
    Interpolates C f ↑D := by sorry

end FunctionAlgebras
Source
K. A. Baker, A. F. Pixley, Polynomial interpolation and the Chinese remainder theorem for algebraic systems, Math. Z. 143 (1975) 165-174, https://doi.org/10.1007/BF01187059, Theorem 2.1, (1) implies (4); D. Lau, Function Algebras on Finite Sets, Springer Monographs in Mathematics, 2006, https://doi.org/10.1007/3-540-36023-9, Part II, proof of Theorem 8.3.1, step II
Read-back

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

Let CCC be a family of operations on AAA (AAA arbitrary, not assumed finite) containing all projections and closed under composition, d≥2d\ge2d≥2, and m∈Cd+1m\in C_{d+1}m∈Cd+1​ with m(x,…,x,y,x,…,x)=xm(x,\dots,x,y,x,\dots,x)=xm(x,…,x,y,x,…,x)=x for all positions and all x,yx,yx,y. Let n≥1n\ge1n≥1, f:An→Af:A^n\to Af:An→A any total function, and D⊆AnD\subseteq A^nD⊆An a finite set of points. Suppose that for every subset E⊆DE\subseteq DE⊆D with at most ddd elements there is p∈Cnp\in C_np∈Cn​ agreeing with fff on all points of EEE. Then there is a single p∈Cnp\in C_np∈Cn​ agreeing with fff on all points of DDD.

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