Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

collision controlled affine forms

Proved
Couret.InterIA.Catalogue.Parameters.collision_controlled_affine_forms

by alexcour · Nov 8, 2026 · Mathlib c5ea003 (Lean v4.30.0)

couret-programmecouret-unification-20261108

For every positive integer mmm and finite subsets S,TS,TS,T of R=Z/(2m)ZR=ℤ/(2m)ℤR=Z/(2m)Z, assume ∣S∣=∣T∣=4|S|=|T|=4∣S∣=∣T∣=4, that for every z∈Rz∈Rz∈R the numbers of ordered pairs in S2S²S2 and T2T²T2 summing to zzz agree, and that there are no unit u∈Ru∈Ru∈R and v∈Rv∈Rv∈R with uS+v=TuS+v=TuS+v=T. There exists t∈{0,m}t∈\{0,m\}t∈{0,m} such that, with Tt=T+tT_t=T+tTt​=T+t, either there exist a positive even integer qqq with 2m=4q2m=4q2m=4q, a unit u∈Ru∈Ru∈R, and v,x∈Rv,x∈Rv,x∈R, with x∉{0,q,2q,3q}x∉\{0,q,2q,3q\}x∈/{0,q,2q,3q}, such that uS+v={0,q,x,x+2q}uS+v=\{0,q,x,x+2q\}uS+v={0,q,x,x+2q} and uTt+v={0,q,x+q,x+3q}uT_t+v=\{0,q,x+q,x+3q\}uTt​+v={0,q,x+q,x+3q}, or there exist an integer q>0q>0q>0 with 2m=8q2m=8q2m=8q, a unit u∈Ru∈Ru∈R, and v,c,d∈Rv,c,d∈Rv,c,d∈R, with c∈{2q,6q}c∈\{2q,6q\}c∈{2q,6q} and d∈{3q,7q}d∈\{3q,7q\}d∈{3q,7q}, such that uS+v={c,d,0,4q}uS+v=\{c,d,0,4q\}uS+v={c,d,0,4q} and uTt+v={c,d,q,5q}uT_t+v=\{c,d,q,5q\}uTt​+v={c,d,q,5q}.

Preamble
import Definitions.Def_Couret_AffineParameterControls_321393084939
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.BigOperators.Ring.Finset
import Mathlib.Algebra.MonoidAlgebra.Defs
import Mathlib.Algebra.MonoidAlgebra.MapDomain
import Mathlib.Data.Finset.Insert
import Mathlib.Data.Finset.Prod
import Mathlib.Data.Finset.SymmDiff
import Mathlib.Data.ZMod.Basic
import Mathlib.Data.ZMod.Units
import Mathlib.GroupTheory.OrderOfElement
import Mathlib.Tactic.Abel
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Ring
import Mathlib.Tactic.Tauto
import Theorems.Thm_Couret_InterIA_Catalogue_Affine_collision_affine_forms
import Theorems.Thm_Couret_InterIA_Catalogue_Lifts_even_collision_eight_divides
import Theorems.Thm_Couret_InterIA_Catalogue_Parameters_affine_image_card
import Theorems.Thm_Couret_InterIA_Catalogue_Parameters_two_pattern_parameter_separation
import Definitions.Def_Couret_AffineSupportForms_4a272694daca
import Definitions.Def_Couret_OrbitLiftTranslation_2f31fa3b99fa
import Definitions.Def_Couret_QuotientBridge_26f10959e8eb

set_option autoImplicit false
namespace Couret.InterIA.Catalogue.Parameters
open Finset Couret.InterIA.Catalogue.Affine Couret.InterIA.Parity

variable {G : Type*} [DecidableEq G]











Formal statement
theorem collision_controlled_affine_forms (m : ℕ) (hm : 0 < m)
    (S T : Finset (ZMod (2*m))) (hS : S.card=4) (hT : T.card=4)
    (hsq : ∀ z, orderedSquare S z=orderedSquare T z)
    (hnaff : ¬ Couret.InterIA.NormalForm.AffineEquivalent S T) :
    ∃ t : ZMod (2*m), (t=0 ∨ t=m) ∧
      (TwoControlledForm m S (T.image (fun x => x+t)) ∨ FourAffineForm m S (T.image (fun x => x+t))) := by sorry


end Couret.InterIA.Catalogue.Parameters
Source
Alexandre Couret, Couret — Additive reconstruction: STROBO-4, singleton collisions and RECOH formal proof artifacts, https://zenodo.org/records/23980513; archive COURET_MATHEMATIQUES_20261105.zip, SHA-256 19a3b59aee930df74cab79c27b29e014843bd17179a26fef1261ed6b5a651ab7; file source-tree/research/interia/m026-hk-review-corollaries-20261103/AffineParameterControls.lean, lines 80–91; source file SHA-256 b23f6d173f81bdcce0efd0f521f478b044082f8c922fd091f81c4bf2ca25e413; theorem Couret.InterIA.Catalogue.Parameters.collision_controlled_affine_forms

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me