Counterexample structure (m) — A minimum counterexample has no abelian congruence other than equality
ProvedFiniteMagmaE677.eq_of_rel_of_abelian_congruence_of_minimal_counterexampleLet be a finite E677 magma that fails E255 at a point , that is, with . Suppose that has minimum order: every E677 operation on with satisfies E255.
A congruence of is abelian when it satisfies the term condition : for every term function of arity (a map given by a -term), all and all ,
Theorem. Every abelian congruence of is the equality relation.
Use in a counterexample search. In the normal form of Counterexample structure (k), the congruence generated by is the least congruence other than equality (the monolith). By this theorem the monolith is not abelian, and is not an abelian algebra (take universal). For example, is not an affine extension over an abelian group with at least two elements, with endomorphisms : there "same first coordinate" is an abelian congruence (by induction on terms; not part of the Lean theorem). ETP blueprint Lemma 13.4 already excludes these extensions; the theorem needs no such coordinates.
Proof idea. Only the term is used. For this term, the term condition says: two -related rows that agree in a column agree in every column -related to . If relates two distinct elements, then is a smaller E677 magma, so it satisfies E255, and . Counterexample structure (g) then gives two -related rows that agree in column and differ in a column -related to .
Prior work. The term condition is standard (R. Freese and R. McKenzie, Commutator Theory for Congruence Modular Varieties, Definitions 3.2 and 5.3; with one distinguished variable as in M. Bonatto and D. Stanovský, arXiv:1902.08980v3). The step from an abelian congruence to row agreement is Lemma 5.1 of Bonatto and Stanovský (arXiv:1902.08980v3): in every left quasigroup (a finite E677 magma is one, by Lemma 13.1(i)), implies that acts -semiregularly. With and the displacements for , this gives row agreement. The step from row agreement to E255 is T. Tao's argument (ETP Zulip thread "FINITE: 677 -> 255", 2024-12-14). With these two steps and minimality, the theorem is a short corollary. B. Le Floch (same thread, 2024-12-14) proved that the affine extensions above satisfy E255 when the base does (ETP blueprint Lemma 13.4). S. Chuks-Onah (same thread, June 2026) proposed to exclude a minimal counterexample through its monolith by Lemma 13.4 when the step is affine; one step of his argument that it is affine was not proved. On 2026-06-20 he wrote, with no proof, that an abelian displacement group makes the monolith step affine, so that the linear-extension lemma applies. No earlier proof of the theorem was found in the ETP blueprint, the ETP paper (arXiv:2512.07087v2), the ETP Zulip thread up to 2026-10-14, Freese–McKenzie, Burris–Sankappanavar, or papers on left quasigroups and racks; his claim of 2026-06-20, with the lemma above, would give it. The new content is a proof, checked in Lean.
Formalization Note The hypotheses h, hmin, z, hz, r, hr and hcompat are those of Counterexample structure (b), so the theorem applies directly to the output of (k). A term function of arity is a function p : (Fin (k + 1) → α) → α that satisfies every predicate T that holds at the projections fun v => v i and is closed under pointwise op. The tuple is Fin.cons x c, and the term condition is habel.
import Definitions.Def_FiniteMagmaE677 import Mathlib universe u open FiniteMagmaE677
theorem FiniteMagmaE677.eq_of_rel_of_abelian_congruence_of_minimal_counterexample
{α : Type u} [Finite α] (op : α → α → α) (h : FiniteMagmaE677.E677 op)
(hmin : ∀ n : ℕ, n < Nat.card α → ∀ op' : Fin n → Fin n → Fin n,
FiniteMagmaE677.E677 op' → FiniteMagmaE677.E255 op')
(z : α) (hz : op (op (op z z) z) z ≠ z)
(r : α → α → Prop) (hr : Equivalence r)
(hcompat : ∀ a a' b b' : α, r a a' → r b b' → r (op a b) (op a' b'))
(habel : ∀ (k : ℕ) (p : (Fin (k + 1) → α) → α),
(∀ T : ((Fin (k + 1) → α) → α) → Prop, (∀ i : Fin (k + 1), T (fun v => v i)) →
(∀ f g : (Fin (k + 1) → α) → α, T f → T g → T (fun v => op (f v) (g v))) → T p) →
∀ (x y : α) (c d : Fin k → α), r x y → (∀ i : Fin k, r (c i) (d i)) →
p (Fin.cons x c) = p (Fin.cons x d) → p (Fin.cons y c) = p (Fin.cons y d))
(a b : α) (hab : r a b) :
a = b := by sorry