Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Canonical parametrization of zero-free nontranslation collisions

Proved
Couret.STROBO2TORS.nontranslationCollision_param_iff

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

couret-programmecouret-unification-20261108

Let GGG be a finite abelian group, N=∣G∣N=|G|N=∣G∣, H=G[2]={u:2u=0}H=G[2]=\{u:2u=0\}H=G[2]={u:2u=0}, h=∣H∣h=|H|h=∣H∣, t=∣G[3]∣t=|G[3]|t=∣G[3]∣, and D=∣2G∣D=|2G|D=∣2G∣. Write RS(z)R_S(z)RS​(z) for the ordered pair-sum count of a finite support SSS, F(S)={T:∣T∣=3,RT=RS}F(S)=\{T:|T|=3,R_T=R_S\}F(S)={T:∣T∣=3,RT​=RS​}, O(S)={S+u:u∈H}O(S)=\{S+u:u\in H\}O(S)={S+u:u∈H}, and F∗={S∈F:0∉S}F^*=\{S\in F:0\notin S\}F∗={S∈F:0∈/S}. Ordinary full fibres have size hhh, exceptional full fibres size 2h2h2h. All displayed subtractions are natural subtraction, truncated at zero, and all quotients are integer division. For arbitrary finite supports S,TS,TS,T, they are zero-free triples with RS=RTR_S=R_TRS​=RT​ and no translation between them if and only if there exist a,d,v,u∈Ga,d,v,u\in Ga,d,v,u∈G such that d≠0d\ne0d=0, 2d=02d=02d=0, v≠0v\ne0v=0, 3v=03v=03v=0, 2u=02u=02u=0, and

S={a,a+v,a+v+d},T={a,a−v,a−v+d}+u,0∉S∪T.S=\{a,a+v,a+v+d\},\qquad T=\{a,a-v,a-v+d\}+u,\qquad0\notin S\cup T.S={a,a+v,a+v+d},T={a,a−v,a−v+d}+u,0∈/S∪T.

The zero-free conditions apply to both supports.

Preamble
import Aesop
import Definitions.Def_Couret_Strobo2TorsPairCount_5c76f0dc12bb
import Lean.Elab.Tactic.Omega
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.BigOperators.Group.Finset.Sigma
import Mathlib.Data.Finset.Powerset
import Mathlib.Data.Fintype.Card
import Mathlib.Tactic.Abel
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Ring
import Mathlib.Tactic.Tauto
import Theorems.Thm_Couret_STROBO2TORS_exceptionalSupports_eq_params_image
import Theorems.Thm_Couret_STROBO2TORS_exceptional_param_genuine
import Theorems.Thm_Couret_STROBO2TORS_mem_exceptionalParams
import Theorems.Thm_Couret_STROBO2TORS_mem_exceptionalSupports
import Theorems.Thm_Couret_STROBO2TORS_mem_paired_squareFibre
import Theorems.Thm_Couret_STROBO2TORS_paramSupport_card
import Theorems.Thm_Couret_STROBO2TORS_three_torsion_double_eq_neg
import Theorems.Thm_Couret_STROBO2TORS_three_torsion_neg
import Definitions.Def_Couret_Strobo2TorsZeroFree_13701bff33aa
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Ring

set_option autoImplicit false
open scoped BigOperators
namespace Couret.STROBO2TORS
variable {G : Type*} [AddCommGroup G] [DecidableEq G]







section Finite
variable [Fintype G]

Formal statement

theorem nontranslationCollision_param_iff (S T : Finset G) :
    NontranslationCollision S T ↔
      ∃ a d v u : G, d + d = 0 ∧ d ≠ 0 ∧ (v + v) + v = 0 ∧ v ≠ 0 ∧
        u + u = 0 ∧ S = paramSupport ((a, d), v) ∧
        T = translateSupport (paramSupport ((a, d), -v)) u ∧ 0 ∉ S ∧ 0 ∉ T := by sorry































attribute [local instance] Classical.propDecidable





























end Finite
end Couret.STROBO2TORS


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 RECOH/lean/Strobo2TorsPairCount.lean, lines 38–72; source file SHA-256 f6c997c461f640aab1856a21d5adfad3e6bfdbf876e67e5783b3ba87b26827cd; theorem Couret.STROBO2TORS.nontranslationCollision_param_iff

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