Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Cyclic terms of prime arity

Proved
BKAbsorption.cyclic_term_prime

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

absorptionconstraint-satisfactioncyclic-termsmodel-theorytaylor-varietyuniversal-algebra

LLL is a signature without relation symbols. A finite algebra AAA lies in a Taylor variety: it is idempotent (f(a,…,a)=af(a,\dots,a)=af(a,…,a)=a for every basic operation) and satisfies the identities of a fixed Taylor term ttt of arity kkk: for each j<kj<kj<k, t(□0,…,□k−1)≈t(△0,…,△k−1)t(\square_0,\dots,\square_{k-1})\approx t(\triangle_0,\dots,\triangle_{k-1})t(□0​,…,□k−1​)≈t(△0​,…,△k−1​) with □i,△i∈{x,y}\square_i,\triangle_i\in\{x,y\}□i​,△i​∈{x,y}, □j=x\square_j=x□j​=x, △j=y\triangle_j=y△j​=y. Let ppp be a prime with p>∣A∣p>|A|p>∣A∣. Then AAA has a ppp-ary cyclic term operation: an idempotent term operation ttt with t(x0,x1,…,xp−1)=t(x1,…,xp−1,x0)t(x_0,x_1,\dots,x_{p-1})=t(x_1,\dots,x_{p-1},x_0)t(x0​,x1​,…,xp−1​)=t(x1​,…,xp−1​,x0​) for all xi∈Ax_i\in Axi​∈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, Theorem 4.2.  Let `A` be a finite algebra in a Taylor variety (`A` satisfies the
idempotency and Taylor identities of a Taylor datum `T`) and let `p` be a prime with
`p > |A|`.  Then `A` has a `p`-ary cyclic term operation. -/
theorem cyclic_term_prime {A : Type w} [L.Structure A] [Finite A] (T : TaylorDatum L)
    (hA : IsTaylorAlg T A) (p : ℕ) (hp : p.Prime) (hpA : Nat.card A < p) :
    HasCyclicTermOp L A p := 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), Thm 4.2
Read-back

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

Let AAA be a finite algebra that is idempotent and satisfies the Taylor identities of a datum TTT, and let ppp be a prime with ∣A∣<p|A|<p∣A∣<p. Then AAA has a ppp-ary cyclic term operation: a ppp-ary term ttt with tA(a,…,a)=at^A(a,\dots,a)=atA(a,…,a)=a for all a∈Aa\in Aa∈A and tA(x0,…,xp−1)=tA(x1,…,xp−1,x0)t^A(x_0,\dots,x_{p-1})=t^A(x_1,\dots,x_{p-1},x_0)tA(x0​,…,xp−1​)=tA(x1​,…,xp−1​,x0​) for all (x0,…,xp−1)∈Ap(x_0,\dots,x_{p-1})\in A^p(x0​,…,xp−1​)∈Ap.

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