Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Left orbits in a finite E677 magma have a positive period

Proved
FiniteMagmaE677.left_orbit_positive_period

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

For x∈αx\in\alphax∈α write Lx(z)=x⋄zL_x(z)=x\diamond zLx​(z)=x⋄z for left translation by xxx. Then the orbit of xxx under LxL_xLx​ returns to xxx after a positive number of steps: there is a natural number ddd with

d>0andLx d(x)=x.d>0\qquad\text{and}\qquad L_x^{\,d}(x)=x.d>0andLxd​(x)=x.

Consequently the left orbit Ox={Lx n(x):n≥0}O_x=\{L_x^{\,n}(x):n\ge 0\}Ox​={Lxn​(x):n≥0} is a finite cycle through xxx, and every orbit point has an orbit predecessor. This is the period-existence input for orbit arguments on the mission; it is independent of any fixer or collision hypothesis.

Formalization Note The iterate Lx d(x)L_x^{\,d}(x)Lxd​(x) is written (op x)^[d] x, matching the orbit predicate InLeftOrbit of the mission's definition bundle. The statement asserts existence of some positive return time, not that ddd is minimal.

Preamble
import Definitions.Def_FiniteMagmaE677

universe u
Formal statement
theorem FiniteMagmaE677.left_orbit_positive_period
    {α : Type u} [Fintype α] (op : α → α → α) (h : FiniteMagmaE677.E677 op)
    (x : α) :
    ∃ d : ℕ, 0 < d ∧ (op x)^[d] x = x := by sorry
Source
Supporting lemma for the finite E677 to E255 formalization, 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