Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A term reaching every element from every coordinate

Proved
BKAbsorption.absorption_free_term

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. B⊴AB\trianglelefteq AB⊴A (BBB absorbs AAA): BBB is a subuniverse and some term operation ttt gives t(a0,…,an−1)∈Bt(a_0,\dots,a_{n-1})\in Bt(a0​,…,an−1​)∈B whenever all aia_iai​ but at most one lie in BBB; proper means ∅≠B≠A\emptyset\neq B\neq A∅=B=A; B⊴ ⁣ ⁣⊴AB\trianglelefteq\!\!\trianglelefteq AB⊴⊴A: BBB is nonempty, absorbs AAA, and no proper subalgebra of BBB absorbs AAA. If AAA has no proper absorbing subuniverse, then there is a term operation vvv of positive arity nnn such that for all b,c∈Ab,c\in Ab,c∈A and every i<ni<ni<n there are a0,…,an−1∈Aa_0,\dots,a_{n-1}\in Aa0​,…,an−1​∈A with ai=ba_i=bai​=b and v(a0,…,an−1)=cv(a_0,\dots,a_{n-1})=cv(a0​,…,an−1​)=c.

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, 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 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), Prop 2.7
Read-back

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

Let AAA be a finite (possibly empty) algebra and TTT a Taylor datum such that AAA is idempotent and satisfies the Taylor identities of TTT. Assume AAA has no absorbing subuniverse BBB with ∅≠B≠A\emptyset\neq B\neq A∅=B=A. Then there exist n≥1n\ge 1n≥1 and an nnn-ary term vvv such that

∀b,c∈A  ∀i<n  ∃ a0,…,an−1∈A:ai=b  and  vA(a0,…,an−1)=c.\forall b,c\in A\ \ \forall i<n\ \ \exists\, a_0,\dots,a_{n-1}\in A:\quad a_i=b\ \text{ and }\ v^A(a_0,\dots,a_{n-1})=c .∀b,c∈A  ∀i<n  ∃a0​,…,an−1​∈A:ai​=b  and  vA(a0​,…,an−1​)=c.

That is, for every coordinate iii and every bbb, the map vAv^AvA restricted to tuples with bbb in position iii is onto AAA.

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