Cyclic terms of prime arity
ProvedBKAbsorption.cyclic_term_primeabsorptionconstraint-satisfactioncyclic-termsmodel-theorytaylor-varietyuniversal-algebra
is a signature without relation symbols. A finite algebra lies in a Taylor variety: it is idempotent ( for every basic operation) and satisfies the identities of a fixed Taylor term of arity : for each , with , , . Let be a prime with . Then has a -ary cyclic term operation: an idempotent term operation with for all .
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 BKAbsorptionSource
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 be a finite algebra that is idempotent and satisfies the Taylor identities of a datum , and let be a prime with . Then has a -ary cyclic term operation: a -ary term with for all and for all .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.