Six equivalent characterizations of equation 255 at an element
ProvedFiniteMagmaE677.e255_characterizationsequational-theorymagmauniversal-algebra
Let be an element of a finite set with a binary operation satisfying E677, and write . The following six statements are equivalent:
- (equation 255 holds at );
- has a fixer: there is with ;
- there is with ;
- there is with ;
- there is with ;
- there is with .
Together with fixer uniqueness (the fixer, when it exists, equals ), this is the finite-magma form of the Equational Theories Project blueprint's lemma on equivalent characterizations of equation 255. Every implication is one or two instances of E677 plus left cancellations, so each of the six shapes is a valid certificate of 255 at .
Preamble
import Definitions.Def_FiniteMagmaE677 import Theorems.Thm_FiniteMagmaE677_left_bijective import Theorems.Thm_FiniteMagmaE677_fixer_unique universe u
Formal statement
theorem FiniteMagmaE677.e255_characterizations {α : Type u} [Fintype α]
(op : α → α → α) (h : FiniteMagmaE677.E677 op) (x : α) :
(x = op (op (op x x) x) x ↔ ∃ y : α, op y x = x) ∧
((∃ y : α, op y x = x) ↔ ∃ w : α, op (op x w) x = x) ∧
((∃ w : α, op (op x w) x = x) ↔ ∃ z : α, op x (op z x) = z) ∧
((∃ z : α, op x (op z x) = z) ↔ ∃ y : α, op (op x y) x = y) ∧
((∃ y : α, op (op x y) x = y) ↔ ∃ y : α, op x (op y y) = y) := by sorrySource
Equational Theories Project, online proof blueprint, Chapter 13 (677), equivalence lemma for 255, https://teorth.github.io/equational_theories/blueprint/677-chapter.html; Lean proof contributed here.