Taylor varieties are characterized by cyclic terms
ProvedBKAbsorption.taylor_iff_cyclicis a signature without relation symbols and a finite idempotent algebra ( for every basic operation), so the variety generated by is idempotent and satisfies exactly the identities of . The following are equivalent: (1) is a Taylor variety, i.e. satisfies the identities of some Taylor term ( of arity with, for each , , , , ); (2) has a cyclic term operation of some arity (an idempotent term operation with ); (3) has a cyclic term operation of arity for every prime .
import Definitions.Def_BKAbsorption_defs universe u v w w' open FirstOrder FirstOrder.Language
namespace BKAbsorption
variable {L : FirstOrder.Language.{u, v}} [L.IsAlgebraic]
/-- Barto–Kozik, Theorem 4.1. Let `A` be a finite idempotent algebra (so the variety `V(A)` it
generates is idempotent and satisfies exactly the identities of `A`). The following are
equivalent:
* `V(A)` is a Taylor variety, i.e. `A` satisfies the identities of some Taylor term;
* `A` has a cyclic term operation (of some arity `k ≥ 2`);
* `A` has a cyclic term operation of arity `p` for every prime `p > |A|`. -/
theorem taylor_iff_cyclic {A : Type w} [L.Structure A] [Finite A] (hid : IsIdempotent L A) :
((∃ T : TaylorDatum L, IsTaylorAlg T A) ↔ ∃ k : ℕ, 2 ≤ k ∧ HasCyclicTermOp L A k) ∧
((∃ k : ℕ, 2 ≤ k ∧ HasCyclicTermOp L A k) ↔
∀ p : ℕ, p.Prime → Nat.card A < p → HasCyclicTermOp L A p) := by sorry
end BKAbsorptionRead-back
What the Lean code literally says, in plain math · claude-opus-5-5
Let be a finite (possibly empty) algebra in which every basic operation is idempotent: for every symbol of every arity (no Taylor hypothesis is assumed). Consider the three statements
- (a) there is a Taylor datum such that satisfies its identities, i.e. for each and all , , where are patterns in the two variables with in position on the left and in position on the right;
- (b) for some , has a -ary cyclic term operation: a -ary term with and for all ;
- (c) for every prime with , has a -ary cyclic term operation (same meaning as in (b), with ).
The theorem asserts both
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.