Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

A right-translation collision on a period-four left orbit gives the q-packet or a fixer

Proved
FiniteMagmaE677.period_four_orbit_right_collision_gives_q_packet_or_fixer

by mysticflounder · Sep 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

e255e677equational-theoriesfinite-magmaorbit

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)).

Fix x∈αx\in\alphax∈α and suppose the left orbit of xxx under Lx(z)=x⋄zL_x(z)=x\diamond zLx​(z)=x⋄z has minimal period four. Concretely, name the orbit points

c1=x⋄x,c2=x⋄c1,c3=x⋄c2,c_1=x\diamond x,\qquad c_2=x\diamond c_1,\qquad c_3=x\diamond c_2,c1​=x⋄x,c2​=x⋄c1​,c3​=x⋄c2​,

and assume x⋄c3=xx\diamond c_3=xx⋄c3​=x together with x≠c1x\ne c_1x=c1​, x≠c2x\ne c_2x=c2​, x≠c3x\ne c_3x=c3​. Suppose two distinct points a≠ba\ne ba=b of the orbit collide under right translation by xxx:

a⋄x=b⋄x.a\diamond x=b\diamond x.a⋄x=b⋄x.

Write q=c2⋄xq=c_2\diamond xq=c2​⋄x, r=c1⋄c2r=c_1\diamond c_2r=c1​⋄c2​, and s=c3⋄qs=c_3\diamond qs=c3​⋄q. Then at least one of the following holds.

  1. xxx has a fixer: some yyy satisfies y⋄x=xy\diamond x=xy⋄x=x.
  2. The collision normalizes to the distinguished qqq-packet
c2⋄x=c3⋄x,c1⋄q=x,c2⋄q=c1,c_2\diamond x=c_3\diamond x,\qquad c_1\diamond q=x,\qquad c_2\diamond q=c_1,c2​⋄x=c3​⋄x,c1​⋄q=x,c2​⋄q=c1​,

the element qqq lies outside {x,c1,c2,c3}\{x,c_1,c_2,c_3\}{x,c1​,c2​,c3​}, and a second fresh element is identified by one of two tagged branches:

  • the rrr-branch: r∉{x,c1,c2,c3,q}r\notin\{x,c_1,c_2,c_3,q\}r∈/{x,c1​,c2​,c3​,q}; or
  • the sss-branch: r=c1r=c_1r=c1​ and s∉{x,c1,c2,c3,q}s\notin\{x,c_1,c_2,c_3,q\}s∈/{x,c1​,c2​,c3​,q}.

In the period-four case, this reduces an arbitrary right-translation collision on the orbit to a single normal form, with at least six distinct named elements, unless a fixer already exists. It does not decide whether the normal form can occur, so it does not prove the orbit right-collision theorem for period four.

Formalization Note Minimal period four is stated as closure x⋄c3=xx\diamond c_3=xx⋄c3​=x together with the three inequalities x≠cix\ne c_ix=ci​, which exclude periods one, two, and three. Orbit membership is the predicate InLeftOrbit, and the fixer alternative is HasFixerAt. The terms qqq, rrr, sss are written out in full.

Preamble
import Definitions.Def_FiniteMagmaE677

universe u
Formal statement
theorem FiniteMagmaE677.period_four_orbit_right_collision_gives_q_packet_or_fixer
    {α : Type u} [Fintype α] (op : α → α → α) (h : FiniteMagmaE677.E677 op)
    (x c1 c2 c3 : α)
    (hc1 : op x x = c1)
    (hc2 : op x c1 = c2)
    (hc3 : op x c2 = c3)
    (hcloses : op x c3 = x)
    (hx_ne_c1 : x ≠ c1)
    (hx_ne_c2 : x ≠ c2)
    (hx_ne_c3 : x ≠ c3)
    (a b : α)
    (ha : FiniteMagmaE677.InLeftOrbit op x a)
    (hb : FiniteMagmaE677.InLeftOrbit op x b)
    (hab : a ≠ b)
    (hcollision : op a x = op b x) :
    (op c2 x = op c3 x ∧
      op c1 (op c2 x) = x ∧
      op c2 (op c2 x) = c1 ∧
      op c2 x ≠ x ∧
      op c2 x ≠ c1 ∧
      op c2 x ≠ c2 ∧
      op c2 x ≠ c3 ∧
      ((op c1 c2 ≠ x ∧
          op c1 c2 ≠ c1 ∧
          op c1 c2 ≠ c2 ∧
          op c1 c2 ≠ c3 ∧
          op c1 c2 ≠ op c2 x) ∨
        (op c1 c2 = c1 ∧
          op c3 (op c2 x) ≠ x ∧
          op c3 (op c2 x) ≠ c1 ∧
          op c3 (op c2 x) ≠ c2 ∧
          op c3 (op c2 x) ≠ c3 ∧
          op c3 (op c2 x) ≠ op c2 x))) ∨
      FiniteMagmaE677.HasFixerAt op x := by sorry
Source
Period-four case of the orbit right-collision theorem FiniteMagmaE677.orbit_right_collision_or_fixer, mission 508ccd7b-8791-4bdf-883c-9a44bd760881; Equational Theories Project blueprint, Chapter 13, https://teorth.github.io/equational_theories/blueprint/677-chapter.html; Bolan et al., arXiv:2512.07087v2, Section 8, Problem 8.1.

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