Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 8, p. 11 — a minion homomorphism from M_BLP+Aff gives (2L+1)-ary polymorphisms with blocks of sizes L and L+1

Proved
PCSPBLPAff.Characterization.lemma_8

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

block-symmetricminionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polymorphism

Let A,B\mathbf A,\mathbf BA,B be relational structures with the same signature. Suppose MBLP+Aff\mathcal M_{\mathrm{BLP+Aff}}MBLP+Aff​ has a minion homomorphism to Pol(A,B)\mathrm{Pol}(\mathbf A,\mathbf B)Pol(A,B). Then for every L∈NL\in\mathbb NL∈N there is a polymorphism f:A2L+1→Bf:A^{2L+1}\to Bf:A2L+1→B and a partition of [2L+1][2L+1][2L+1] into two blocks, of sizes LLL and L+1L+1L+1, such that fff is invariant under every permutation of its arguments that preserves both blocks:

∀L∈N  ∃f∈Pol(2L+1)(A,B), [2L+1]=B1⊔B2, ∣B1∣=L, ∣B2∣=L+1, f block-symmetric for (B1,B2).\forall L\in\mathbb N\;\exists f\in\mathrm{Pol}^{(2L+1)}(\mathbf A,\mathbf B),\ [2L+1]=B_1\sqcup B_2,\ |B_1|=L,\ |B_2|=L+1,\ f\ \text{block-symmetric for}\ (B_1,B_2).∀L∈N∃f∈Pol(2L+1)(A,B), [2L+1]=B1​⊔B2​, ∣B1​∣=L, ∣B2​∣=L+1, f block-symmetric for (B1​,B2​).

This is the direction "minion homomorphism ⇒ concrete polymorphisms" of the characterization in Theorem 4.

Formalization Note The partition is given by a labelling β:[2L+1]→{0,1}\beta:[2L+1]\to\{0,1\}β:[2L+1]→{0,1}; block 000 has LLL elements and block 111 has L+1L+1L+1. As on the page, no promise-template hypothesis is assumed.

Preamble
import Mathlib
import Definitions.Def_PCSPBLPAff_Characterization_Setting
Formal statement
namespace PCSPBLPAff.Characterization

/-- Lemma 8, p. 11: if `M_BLP+Aff` has a minion homomorphism to `Pol(𝔸, 𝔹)`, then for every
`L ∈ ℕ`, `Pol(𝔸, 𝔹)` contains a block-symmetric polymorphism of arity `2L + 1` with two blocks
of size `L` and `L + 1`. -/
theorem lemma_8 {τ : Type} {ar : τ → ℕ} {A B : Type}
    (𝔸 : PCSPBLPAff.Symmetric.RelStruct τ ar A) (𝔹 : PCSPBLPAff.Symmetric.RelStruct τ ar B) (h : HasMinionHomToPol 𝔸 𝔹) :
    ∀ L : ℕ, ∃ f : (Fin (2 * L + 1) → A) → B, PCSPBLPAff.Symmetric.IsPolymorphism 𝔸 𝔹 f ∧
      ∃ β : Fin (2 * L + 1) → Fin 2,
        (Finset.univ.filter (fun l => β l = 0)).card = L ∧
        (Finset.univ.filter (fun l => β l = 1)).card = L + 1 ∧
        PCSPBLPAff.Symmetric.IsBlockSymmetricFor β f := by sorry

end PCSPBLPAff.Characterization
Source
arXiv:1907.04383v3, Lemma 8, p. 11
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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