Counterexample structure (k) — Normal form: a finite counterexample gives one of minimum order, generated by z, in which every congruence relating two distinct elements relates z and q(z)
ProvedFiniteMagmaE677.exists_minimal_counterexample_normal_formLet be a finite magma that satisfies E677 and fails E255 at some , that is, , where . A congruence of a magma is a reflexive, symmetric and transitive relation on such that and give . Then there are a number , an operation on and a point with these properties.
- satisfies E677 and fails E255 at : , where .
- is generated by : every subset of that contains and is closed under is all of .
- Every congruence of that relates two distinct elements relates and .
- Every E677 operation on with satisfies E255. So is a counterexample of minimum order.
In the terms of universal algebra, the inequality and property 3 imply that is subdirectly irreducible and that the congruence generated by the pair is its monolith, the least congruence other than equality.
This is the standard minimal-counterexample argument of universal algebra (a counterexample of least order is generated by one element and is subdirectly irreducible), written out for E677 and E255. It is not a new result. On the ETP Zulip thread "FINITE: 677 -> 255", T. Tao (2024-12-09) notes that to disprove a one-variable equation such as E255 one can assume that the magma is generated by a single element, M. Bolan (2025-11-21) notes that for E255 only magmas generated by a single element matter, and S. Chuks-Onah (2026-06-10) notes that a minimal counterexample is generated by one element and is subdirectly irreducible.
For a counterexample search: it is enough to search the magmas on with properties 1–3. Properties 1 and 4 are the hypotheses on the magma and on of Counterexample structure (b) and (h)–(j). So those results apply to , and each congruence that relates and and is not the universal relation (with the other hypotheses of (h)–(j)), and each lower bound that they give for is also a lower bound for .
Formalization Note The magma is an operation op on a finite type α, and is an operation opB on Fin n. Property 2 is stated for predicates: a predicate on Fin n that holds at z and is closed under opB holds everywhere. The order is written Nat.card (Fin n), which is . With this form, properties 1 and 4 are the hypotheses h, hz and hmin of (b) and (h)–(j) for Fin n and opB, without rewriting, and combines with the lower bounds of (b), (h) and (j) by transitivity.
import Definitions.Def_FiniteMagmaE677 import Mathlib universe u open FiniteMagmaE677
theorem FiniteMagmaE677.exists_minimal_counterexample_normal_form
{α : Type u} [Finite α] (op : α → α → α) (h : FiniteMagmaE677.E677 op)
(x : α) (hx : op (op (op x x) x) x ≠ x) :
∃ (n : ℕ) (opB : Fin n → Fin n → Fin n) (z : Fin n),
FiniteMagmaE677.E677 opB ∧ opB (opB (opB z z) z) z ≠ z ∧
(∀ S : Fin n → Prop, S z → (∀ a b : Fin n, S a → S b → S (opB a b)) → ∀ a : Fin n, S a) ∧
(∀ r : Fin n → Fin n → Prop, Equivalence r →
(∀ a a' b b' : Fin n, r a a' → r b b' → r (opB a b) (opB a' b')) →
∀ a b : Fin n, a ≠ b → r a b → r z (opB (opB (opB z z) z) z)) ∧
(∀ m : ℕ, m < Nat.card (Fin n) → ∀ op' : Fin m → Fin m → Fin m,
FiniteMagmaE677.E677 op' → FiniteMagmaE677.E255 op') ∧
Nat.card (Fin n) ≤ Nat.card α := by sorry