Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

D4.4d: q-square strict-growth cardinality

Proved
FiniteMagmaE677.period_four_swapped_s_q_square_growth_cardinality

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 and carry a swapped-S one-step packet at x,c1,c2,c3,q,s,t,p,ux,c_1,c_2,c_3,q,s,t,p,ux,c1​,c2​,c3​,q,s,t,p,u. Assume ppp is off CtC_tCt​ and has exact first-return cycle CpC_pCp​. Put v=q⋄qv=q\diamond qv=q⋄q; assume vvv is outside the six named points, off both Ct,CpC_t,C_pCt​,Cp​, and has exact first-return cycle CvC_vCv​.

Then the accounted union has exact size

∣{x,c1,c2,c3,q,s}∪Ct∪Cp∪Cv∣=6+dt+dp+dv.\left|\{x,c_1,c_2,c_3,q,s\}\cup C_t\cup C_p\cup C_v\right|=6+d_t+d_p+d_v.∣{x,c1​,c2​,c3​,q,s}∪Ct​∪Cp​∪Cv​∣=6+dt​+dp​+dv​.

This is a conditional finite-set count. The packet and cycle hypotheses suffice; no ambient finiteness or separate E677 hypothesis is required.

Preamble
import Definitions.Def_FiniteMagmaE677_sswap_renewal
import Mathlib

universe u
open FiniteMagmaE677
Formal statement
theorem FiniteMagmaE677.period_four_swapped_s_q_square_growth_cardinality
{α : Type u} [DecidableEq α] (op : α → α → α)
(x c1 c2 c3 q s t p u : α)
(first : FirstReturn.D4FirstReturn op x c1 c2 c3 t 0)
(pump : SSwap.Pump op x c1 c2 c3 q s t p u first)
(p_off_t : ∀ k, k < first.period → p ≠ (op x)^[k] t)
(pFirst : FirstReturn.D4FirstReturn op x c1 c2 c3 p 0)
(fresh : FirstReturn.FreshOutsideSix x c1 c2 c3 q s (op q q))
(v_off_t : ∀ k, k < first.period → op q q ≠ (op x)^[k] t)
(v_off_p : ∀ k, k < pFirst.period → op q q ≠ (op x)^[k] p)
(vFirst : FirstReturn.D4FirstReturn op x c1 c2 c3 (op q q) 0) :
(((SSwap.namedSix x c1 c2 c3 q s ∪ SSwap.cyclePoints op x t first.period) ∪
    SSwap.cyclePoints op x p pFirst.period) ∪
    SSwap.cyclePoints op x (op q q) vFirst.period).card =
  6 + first.period + pFirst.period + vFirst.period := by sorry
Source
Adam McKenna, The Missing Pair (private repository), revision f9945b937be61f4ca48eb6cafdcfa07ba7a7f78c, lean/E677/Spine/Piece1D4SSwapPNewQSquareRenewal.lean, line 282. 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