Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Conditional E255: left translations closed under conjugation (Padilla)

Proved
FiniteMagmaE677.e255_of_e677_leftMul_conjugacy_closed

by mysticflounder · Oct 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

conditionalconjugacy-closuree255e677magma

This is a conditional implication announced by J Ignacio Padilla on 2026-10-10 in the Lean Zulip topic "FINITE: 677 -> 255", with a Lean proof file in pull request #1518 of the Equational Theories Project (closed without merge by its author on 2026-10-13). Proved on this platform on 2026-10-14 (UTC) by omegaestable; the accepted proof uses a different argument from the pull request. The extra hypothesis is a closure condition on left translations. It is not known to follow from E677, and the theorem does not resolve the unrestricted finite implication E677 →\to→ E255.

Let (α,⋄)(\alpha,\diamond)(α,⋄) be a finite magma satisfying E677: for all p,q∈αp,q\in\alphap,q∈α,

p=q⋄(p⋄((q⋄p)⋄q)).p = q\diamond\bigl(p\diamond((q\diamond p)\diamond q)\bigr).p=q⋄(p⋄((q⋄p)⋄q)).

For a∈αa\in\alphaa∈α write La(z)=a⋄zL_a(z)=a\diamond zLa​(z)=a⋄z for left translation by aaa. In a finite E677 magma every LaL_aLa​ is a bijection. Assume that the left translations are closed under conjugation by left translations: for all a,b∈αa,b\in\alphaa,b∈α there is c∈αc\in\alphac∈α with

Lc∘La=La∘Lb,that is,Lc=La∘Lb∘La−1.L_c\circ L_a = L_a\circ L_b,\qquad\text{that is,}\qquad L_c = L_a\circ L_b\circ L_a^{-1}.Lc​∘La​=La​∘Lb​,that is,Lc​=La​∘Lb​∘La−1​.

Then α\alphaα satisfies E255: for every x∈αx\in\alphax∈α,

x=((x⋄x)⋄x)⋄x.x = ((x\diamond x)\diamond x)\diamond x.x=((x⋄x)⋄x)⋄x.

The hypothesis holds in every affine model x⋄y=λx+μyx\diamond y = \lambda x+\mu yx⋄y=λx+μy over Z/m\mathbb{Z}/mZ/m that satisfies E677. A computational check against the community database of finite E677 magmas at https://eq677.icarm.cloud (4091 tables as of 2026-09-27) found the hypothesis true in 875875875 of them and false in 321632163216, with order 212121 the smallest failing order; every one of those magmas satisfies E255. So the theorem settles the finite implication on a proper subclass only. Its role on the mission is as one case of a possible case split, not as a route to the main theorem.

Formalization Note The source states the hypothesis with an inverse, Lc=La∘Lb∘La−1L_c = L_a\circ L_b\circ L_a^{-1}Lc​=La​∘Lb​∘La−1​, with LaL_aLa​ packaged as a bijection. Here it is stated without inverses, as c⋄(a⋄z)=a⋄(b⋄z)c\diamond(a\diamond z) = a\diamond(b\diamond z)c⋄(a⋄z)=a⋄(b⋄z) for all zzz. Because LaL_aLa​ is a bijection in a finite E677 magma, the source form implies this form (instantiate the source at z=a⋄wz = a\diamond wz=a⋄w and use La−1(a⋄w)=wL_a^{-1}(a\diamond w) = wLa−1​(a⋄w)=w), and this form implies the source form (instantiate this form at w=La−1(z)w = L_a^{-1}(z)w=La−1​(z) and use a⋄La−1(z)=za\diamond L_a^{-1}(z) = za⋄La−1​(z)=z). Finiteness is carried by Fintype α. The empty magma satisfies E255 vacuously, so no nonemptiness hypothesis is needed.

Preamble
import Definitions.Def_FiniteMagmaE677
import Mathlib

universe u
open FiniteMagmaE677
Formal statement
theorem FiniteMagmaE677.e255_of_e677_leftMul_conjugacy_closed
{α : Type u} [Fintype α] (op : α → α → α) (h : FiniteMagmaE677.E677 op)
(hconj : ∀ a b : α, ∃ c : α, ∀ z : α, op c (op a z) = op a (op b z)) :
FiniteMagmaE677.E255 op := by sorry
Source
J Ignacio Padilla, theorem `Eq677.eq255_of_eq677_leftMul_conjugacy_closed`, Equational Theories Project pull request #1518 (https://github.com/teorth/equational_theories/pull/1518), head commit a1e424c5738b28b2411622779ddefead0e760767, file equational_theories/ManuallyProved/Equation677.lean, lines 283-291; discussion in issue #1517 (https://github.com/teorth/equational_theories/issues/1517); announced 2026-10-10 in Lean Zulip channel Equational, topic "FINITE: 677 -> 255" (https://leanprover.zulipchat.com/#narrow/channel/458659-Equational/topic/FINITE.3A.20677.20-.3E.20255).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me