A term reaching every element from every coordinate
ProvedBKAbsorption.absorption_free_termis 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 , , . ( absorbs ): is a subuniverse and some term operation gives whenever all but at most one lie in ; proper means ; : is nonempty, absorbs , and no proper subalgebra of absorbs . If has no proper absorbing subuniverse, then there is a term operation of positive arity such that for all and every there are with and .
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, Proposition 2.7. Let `A` be a finite algebra in a Taylor variety (here: `A`
satisfies the idempotency and Taylor identities of a Taylor datum `T`) and suppose that `A` has
no proper absorbing subalgebra. Then there is a term operation `v ∈ Clo(A)` (of positive arity
`n`) such that for all `b, c ∈ A` and every coordinate `i < n` there are `a₀, …, a_{n-1} ∈ A`
with `aᵢ = b` and `v(a₀, …, a_{n-1}) = c`. -/
theorem absorption_free_term {A : Type w} [L.Structure A] [Finite A] (T : TaylorDatum L)
(hA : IsTaylorAlg T A) (hnp : ¬ HasProperAbsorbing L A) :
∃ (n : ℕ) (v : L.Term (Fin n)), 0 < n ∧
∀ (b c : A) (i : Fin n), ∃ a : Fin n → A, a i = b ∧ v.realize a = c := 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 and a Taylor datum such that is idempotent and satisfies the Taylor identities of . Assume has no absorbing subuniverse with . Then there exist and an -ary term such that
That is, for every coordinate and every , the map restricted to tuples with in position is onto .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.