Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 8.8 — the operation t is cyclic

Proved
AlgebraicPCSP.OneInThree.lemma_8_8

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

cyclic-operationsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1polymorphismspromise-csp

Let s:Dp→Ds:D^p\to Ds:Dp→D be a cyclic operation and let ttt be the p2p^2p2-ary operation

t(x11,x12,…,x1p,x21,…,xpp)=s(s(x11,…,xp1),…,s(x1p,…,xpp)).t(x_{11},x_{12},\dots,x_{1p},x_{21},\dots,x_{pp})=s\big(s(x_{11},\dots,x_{p1}),\dots,s(x_{1p},\dots,x_{pp})\big).t(x11​,x12​,…,x1p​,x21​,…,xpp​)=s(s(x11​,…,xp1​),…,s(x1p​,…,xpp​)).

Then ttt is cyclic as an operation of its p2p^2p2 arguments in the order (x11,x12,…,x1p,x21,…,xpp)(x_{11},x_{12},\dots,x_{1p},x_{21},\dots,x_{pp})(x11​,x12​,…,x1p​,x21​,…,xpp​):

t(x12,…,xpp,x11)=t(x11,x12,…,xpp).t(x_{12},\dots,x_{pp},x_{11})=t(x_{11},x_{12},\dots,x_{pp}).t(x12​,…,xpp​,x11​)=t(x11​,x12​,…,xpp​).

Cyclicity of ttt lets the proof replace a tuple ⟨i⟩\langle i\rangle⟨i⟩ by any cyclic shift of it without changing ttt, which is how covers are built from line segments in Lemma 8.9.

Formalization Note Stated for every ppp and every type DDD; only cyclicity of sss is assumed. The argument tuple is read into a matrix row-major via finProdFinEquiv.

Preamble
import Mathlib
import Definitions.Def_PCSPBLPAff_Symmetric_Setting
import Definitions.Def_AlgebraicPCSP_OneInThree_Structures
import Definitions.Def_AlgebraicPCSP_OneInThree_Matrices
Formal statement
namespace AlgebraicPCSP.OneInThree

/-- Lemma 8.8 (p. 54): if `s` is cyclic, then the `p²`-ary operation `t`, taken on its
arguments in row-major order `(x₁₁, x₁₂, …, x₁ₚ, x₂₁, …, x_pp)`, is cyclic. -/
theorem lemma_8_8 {D : Type} {p : ℕ} (s : (Fin p → D) → D) (hcyc : IsCyclic s) :
    IsCyclic (tFlat s) := by sorry

end AlgebraicPCSP.OneInThree
Source
L. Barto, J. Bulín, A. Krokhin, J. Opršal, Algebraic approach to promise constraint satisfaction, arXiv:1811.00970v3, p. 54, Lemma 8.8
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