Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

An orbit right-collision forces a fixer

Open
FiniteMagmaE677.orbit_right_collision_or_fixer

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

e255e677equational-theoriesfinite-magma

Open structural subproblem (Sub-goal 1; called Piece 1 in the authors' repository). Let α\alphaα be a finite type with an arbitrary total operation ⋄\diamond⋄ satisfying E677, and fix x∈αx\in\alphax∈α. If two elements a,ba,ba,b in the forward orbit x,Lx(x),Lx2(x),…x,L_x(x),L_x^2(x),\ldotsx,Lx​(x),Lx2​(x),… satisfy a⋄x=b⋄xa\diamond x=b\diamond xa⋄x=b⋄x, then either a=ba=ba=b or there is a fixer y⋄x=xy\diamond x=xy⋄x=x. This is an orbit-local collision principle; it does not assert fixer existence for every xxx.

Preamble
import Definitions.Def_FiniteMagmaE677

universe u
Formal statement
theorem FiniteMagmaE677.orbit_right_collision_or_fixer {α : Type u} [Fintype α]
    (op : α → α → α) (h : FiniteMagmaE677.E677 op) (x : α) :
    FiniteMagmaE677.OrbitRightCollisionOrFixer op x := by sorry
Source
Mission-defined structural subproblem; public E677/E255 definitions and background: https://teorth.github.io/equational_theories/blueprint/677-chapter.html
Read-back

What the Lean code literally says, in plain math · gpt-5.6-luna

For every universe-uuu type α\alphaα equipped with a Fintype instance, every binary operation op⁡:α→α→α\operatorname{op}:\alpha\to\alpha\to\alphaop:α→α→α, every proof h:E677(op⁡)h:E677(\operatorname{op})h:E677(op), and every x:αx:\alphax:α, OrbitRightCollisionOrFixer⁡(op⁡,x)\operatorname{OrbitRightCollisionOrFixer}(\operatorname{op},x)OrbitRightCollisionOrFixer(op,x) holds. Thus, for any two left-orbit elements of xxx with equal right products by xxx, either they are equal or xxx has a fixer. For an empty finite type, there is no possible xxx, so the theorem's outer assertion is vacuous.

Human review
  • Endorsed by Shuze Chen · Sep 10, 2026

  • Endorsed by mysticflounder · Sep 10, 2026

    Confirmed by the mission captain (proposal self-audit).

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