Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

D4.4e: q-square contact slack

Proved
FiniteMagmaE677.period_four_swapped_s_q_square_contact_slack

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

e677magmaperiod-fourrenewal

Write Lx(y)=x⋄yL_x(y)=x\diamond yLx​(y)=x⋄y and let Cz={Lxi(z):0≤i<dz}C_z=\{L_x^i(z):0\le i<d_z\}Cz​={Lxi​(z):0≤i<dz​} for an exact first-return cycle of length dzd_zdz​. Let a magma have decidable equality, exact first-return cycles Ct,CpC_t,C_pCt​,Cp​, and q-square seed data for p,up,up,u. Put v=q⋄qv=q\diamond qv=q⋄q and suppose v∈Ct∪Cpv\in C_t\cup C_pv∈Ct​∪Cp​. For a finite set of marked points MMM, define σ(M)=∣(Ct∪Cp)∖M∣\sigma(M)=|(C_t\cup C_p)\setminus M|σ(M)=∣(Ct​∪Cp​)∖M∣.

Then

σ({p,u,v})+1=σ({p,u}).\sigma(\{p,u,v\})+1=\sigma(\{p,u\}).σ({p,u,v})+1=σ({p,u}).

The q-square seed supplies v≠p,uv\ne p,uv=p,u, so this contact removes exactly one previously unmarked point. The statement is local to these fixed cycles and does not provide a recursive descent argument.

Preamble
import Definitions.Def_FiniteMagmaE677_sswap_renewal
import Mathlib

universe u
open FiniteMagmaE677
Formal statement
theorem FiniteMagmaE677.period_four_swapped_s_q_square_contact_slack
{α : Type u} [DecidableEq α] (op : α → α → α)
(x c1 c2 c3 q s t p u : α)
(first : FirstReturn.D4FirstReturn op x c1 c2 c3 t 0)
(pFirst : FirstReturn.D4FirstReturn op x c1 c2 c3 p 0)
(seed : SSwap.QSquareSeed op x c1 c2 c3 q s p u)
(on_accounted : op q q ∈
  SSwap.cyclePoints op x t first.period ∪ SSwap.cyclePoints op x p pFirst.period) :
SSwap.markedSlack op x t p first.period pFirst.period {p, u, op q q} + 1 =
  SSwap.markedSlack op x t p first.period pFirst.period {p, u} := by sorry
Source
Adam McKenna, The Missing Pair (private repository), revision f9945b937be61f4ca48eb6cafdcfa07ba7a7f78c, lean/E677/Spine/Piece1D4SSwapPNewQSquareRenewal.lean, line 224. The accepted proof 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