Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

D4.3c — S first-step cycle closeout

Open
FiniteMagmaE677.period_four_s_first_return_gives_fixer

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

algebrae677finite-magmaperiod-four

CONJECTURED — open branch closeout. Let a finite set carry an arbitrary binary operation ⋄\diamond⋄ satisfying E677:

z=y⋄(z⋄((y⋄z)⋄y))for all z,y.z=y\diamond\bigl(z\diamond((y\diamond z)\diamond y)\bigr)\quad\text{for all }z,y.z=y⋄(z⋄((y⋄z)⋄y))for all z,y.

Write Lx(z)=x⋄zL_x(z)=x\diamond zLx​(z)=x⋄z. The distinguished packet records four pairwise distinct points with

Lx(x)=c1,Lx(c1)=c2,Lx(c2)=c3,Lx(c3)=x.L_x(x)=c_1,\quad L_x(c_1)=c_2,\quad L_x(c_2)=c_3,\quad L_x(c_3)=x.Lx​(x)=c1​,Lx​(c1​)=c2​,Lx​(c2​)=c3​,Lx​(c3​)=x.

Set 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. The packet also records that qqq is outside the four displayed points and

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

A first-return packet for a seed vvv through depth nnn supplies its positive minimal return period d>nd>nd>n. The points v,Lx(v),…,Lxd−1(v)v,L_x(v),\ldots,L_x^{d-1}(v)v,Lx​(v),…,Lxd−1​(v) are pairwise distinct and outside the four displayed points, and Lxd(v)=vL_x^d(v)=vLxd​(v)=v. The initialized prefix and all tagged branch equations are retained as hypotheses.

Assume the S branch: r=c1r=c_1r=c1​, sss is outside {x,c1,c2,c3,q}\{x,c_1,c_2,c_3,q\}{x,c1​,c2​,c3​,q}, and Lx(q)L_x(q)Lx​(q) is outside {x,c1,c2,c3,q,s}\{x,c_1,c_2,c_3,q,s\}{x,c1​,c2​,c3​,q,s}. Retain the tagged S start and the first-return packet of qqq through depth 111.

The target is a fixer for the original base point:

∃y,y⋄x=x.\exists y,\quad y\diamond x=x.∃y,y⋄x=x.

This is one retained branch of the period-four orbit-collision problem. The cycle data and local contact facts are established inputs; the displayed fixer conclusion is still open. No bound on the size of the finite carrier is imposed.

Preamble
import Definitions.Def_FiniteMagmaE677_d4_first_return

universe u

open FiniteMagmaE677.FirstReturn
Formal statement
theorem FiniteMagmaE677.period_four_s_first_return_gives_fixer
    {α : Type u} [Fintype α] (op : α → α → α) (h : FiniteMagmaE677.E677 op)
    (x c1 c2 c3 : α)
    (packet : D4Distinguished op x c1 c2 c3)
    (start : STaggedStart op x c1 c2 c3)
    (fresh : FreshOutsideSix x c1 c2 c3 (op c2 x) (op c3 (op c2 x)) (op x (op c2 x)))
    (initial_trace : D4Trace op x c1 c2 c3 (op c2 x) 1)
    (first_return : D4FirstReturn op x c1 c2 c3 (op c2 x) 1)
    : FiniteMagmaE677.HasFixerAt op x := by sorry
Source
Adam McKenna, The Missing Pair (private repository), revision 9b76827c2246f0e6288466768f15b5c6f9350d71, lean/E677/Spine/Piece1D4CycleContact.lean, E677D4QCycleContactBranch and e677_d4_q_cycleContactPacket_of_firstReturnPacket; docs/current/e677-closure-plan-2026-08-04.md, D4 first-return collapse frontier. Open target; the statement on this platform is the public record.

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