Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Subpowers are determined by their d-fold projections

Open
FunctionAlgebras.projections_determine

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. An nnn-ary fff preserves R⊆AιR\subseteq A^\iotaR⊆Aι if applying fff coordinatewise to any nnn tuples of RRR gives a tuple of RRR; InvkC\mathrm{Inv}_k CInvk​C is the set of kkk-ary relations preserved by all members of CCC. Let ι\iotaι be a finite set and R,S⊆AιR,S\subseteq A^\iotaR,S⊆Aι relations preserved by every member of CCC. If for every J⊆ιJ\subseteq\iotaJ⊆ι with ∣J∣≤d|J|\le d∣J∣≤d the projections of RRR and SSS onto the coordinates JJJ coincide, then R=SR=SR=S.

Preamble
import Definitions.Def_FunctionAlgebras_defs

universe u
Formal statement
namespace FunctionAlgebras

variable {A : Type u}

/-- Baker–Pixley (1975), Theorem 2.1, (1) ⇒ (2), for the clone `C` of term operations of an
algebra on `A`.  If `C` contains a `(d+1)`-ary near-unanimity operation (`d ≥ 2`), then a
subuniverse `R` of a finite power `A^ι` is uniquely determined by its projections onto the sets
of at most `d` coordinates: two subuniverses with the same such projections are equal. -/
theorem projections_determine (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)
    {ι : Type*} [Finite ι] (R S : Set (ι → A))
    (hR : ∀ (n : ℕ), ∀ f ∈ C n, Preserves f R) (hS : ∀ (n : ℕ), ∀ f ∈ C n, Preserves f S)
    (hproj : ∀ J : Finset ι, J.card ≤ d →
      (fun x : ι → A => fun j : J => x j) '' R = (fun x : ι → A => fun j : J => x j) '' S) :
    R = S := 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 (2)
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 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 ι\iotaι be a finite index type and R,S⊆AιR,S\subseteq A^\iotaR,S⊆Aι relations, each preserved by every operation of every arity (including 000) in CCC. Suppose that for every set J⊆ιJ\subseteq\iotaJ⊆ι of at most ddd coordinates, the projection of RRR onto the coordinates in JJJ (restriction of tuples to JJJ) equals the projection of SSS onto JJJ. Then R=SR=SR=S.

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