Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Cyclic terms via cyclic relations

Proved
BKAbsorption.cyclic_iff_subpower

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

absorptionconstraint-satisfactioncyclic-termsmodel-theorytaylor-varietyuniversal-algebra

LLL is a signature without relation symbols and AAA a finite idempotent algebra (f(a,…,a)=af(a,\dots,a)=af(a,…,a)=a for every basic operation); k≥2k\ge2k≥2. AAA has a kkk-ary cyclic term operation (an idempotent term operation with t(x0,x1,…,xk−1)=t(x1,…,xk−1,x0)t(x_0,x_1,\dots,x_{k-1})=t(x_1,\dots,x_{k-1},x_0)t(x0​,x1​,…,xk−1​)=t(x1​,…,xk−1​,x0​)) iff every nonempty cyclic subuniverse RRR of AkA^kAk (closed under (a0,…,ak−1)↦(a1,…,ak−1,a0)(a_0,\dots,a_{k-1})\mapsto(a_1,\dots,a_{k-1},a_0)(a0​,…,ak−1​)↦(a1​,…,ak−1​,a0​)) contains a constant tuple (a,…,a)(a,\dots,a)(a,…,a).

Preamble
import Definitions.Def_BKAbsorption_defs

universe u v w w'

open FirstOrder FirstOrder.Language
Formal statement
namespace BKAbsorption

variable {L : FirstOrder.Language.{u, v}} [L.IsAlgebraic]

/-- Barto–Kozik, Lemma 4.4 (from Barto–Kozik–Maróti–Niven).  For a finite idempotent algebra `A`
and `k ≥ 2` the following are equivalent: `A` has a `k`-ary cyclic term operation; every
nonempty cyclic subuniverse of `A^k` contains a constant tuple. -/
theorem cyclic_iff_subpower {A : Type w} [L.Structure A] [Finite A] (hid : IsIdempotent L A)
    (k : ℕ) (hk : 2 ≤ k) :
    HasCyclicTermOp L A k ↔
      ∀ R : Set (Fin k → A), R.Nonempty → IsSubpower L R → IsCyclicRel R →
        ∃ a : A, (fun _ => a) ∈ R := by sorry

end BKAbsorption
Source
L. Barto, M. Kozik, Absorbing subalgebras, cyclic terms, and the constraint satisfaction problem, Logical Methods in Computer Science 8(1:07) 2012, https://doi.org/10.2168/LMCS-8(1:7)2012 (arXiv:1201.0557), Lemma 4.4
Read-back

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

Let AAA be a finite algebra in which every basic operation is idempotent, and let k≥2k\ge 2k≥2. Then the following are equivalent:

  1. There is a kkk-ary term ttt with tA(a,…,a)=at^A(a,\dots,a)=atA(a,…,a)=a for all aaa and
tA(x0,x1,…,xk−1)=tA(x1,…,xk−1,x0)for all (x0,…,xk−1)∈Ak.t^A(x_0,x_1,\dots,x_{k-1})=t^A(x_1,\dots,x_{k-1},x_0)\quad\text{for all }(x_0,\dots,x_{k-1})\in A^k.tA(x0​,x1​,…,xk−1​)=tA(x1​,…,xk−1​,x0​)for all (x0​,…,xk−1​)∈Ak.
  1. Every nonempty R⊆AkR\subseteq A^kR⊆Ak that is closed under coordinatewise basic operations and closed under the cyclic shift (x0,…,xk−1)↦(x1,…,xk−1,x0)(x_0,\dots,x_{k-1})\mapsto(x_1,\dots,x_{k-1},x_0)(x0​,…,xk−1​)↦(x1​,…,xk−1​,x0​) contains a constant tuple (a,…,a)(a,\dots,a)(a,…,a).

No Taylor hypothesis is assumed.

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