Local-to-global interpolation
OpenFunctionAlgebras.local_interpolationis a set; operations are maps (). is a clone: it contains all projections and is closed under composition . contains a -ary near-unanimity operation , i.e. for every position of , where . Let , an -ary partial function and a finite set (its domain). If for every with some agrees with on , then some agrees with on all of .
import Definitions.Def_FunctionAlgebras_defs universe u
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 FunctionAlgebrasRead-back
What the Lean code literally says, in plain math · claude-opus-5-5
Let be a family of operations on ( arbitrary, not assumed finite) containing all projections and closed under composition, , and with for all positions and all . Let , any total function, and a finite set of points. Suppose that for every subset with at most elements there is agreeing with on all points of . Then there is a single agreeing with on all points of .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.