Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Membership in the ordered nontranslation collision list

Proved
Couret.STROBO2TORS.mem_orderedNontranslationPairs

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

couret-programmecouret-unification-20261108

Let GGG be a finite abelian group and S,T⊆GS,T\subseteq GS,T⊆G finite. Write QS(z)=∣{(x,y)∈S2:x+y=z}∣Q_S(z)=|\{(x,y)\in S^2:x+y=z\}|QS​(z)=∣{(x,y)∈S2:x+y=z}∣, retaining ordered pairs and diagonals. Let P\mathcal PP be the finite enumeration obtained by filtering all ordered pairs of three-element supports by the nontranslation-collision predicate. Then

(S,T)∈P  ⟺  ∣S∣=∣T∣=3,0∉S,0∉T,QS=QT,¬∃u∈G, T=S+u.(S,T)\in\mathcal P\iff |S|=|T|=3,\quad0\notin S,\quad0\notin T,\quad Q_S=Q_T,\quad\neg\exists u\in G,\ T=S+u.(S,T)∈P⟺∣S∣=∣T∣=3,0∈/S,0∈/T,QS​=QT​,¬∃u∈G, T=S+u.

Here S+u={x+u:x∈S}S+u=\{x+u:x\in S\}S+u={x+u:x∈S}. This connects the finite enumeration to its exact semantic predicate.

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_mem_tripleSupports
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]
































attribute [local instance] Classical.propDecidable



Formal statement
theorem mem_orderedNontranslationPairs (S T : Finset G) :
    (S,T) ∈ orderedNontranslationPairs ↔ NontranslationCollision S T := by sorry


























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 328–331; source file SHA-256 f6c997c461f640aab1856a21d5adfad3e6bfdbf876e67e5783b3ba87b26827cd; theorem Couret.STROBO2TORS.mem_orderedNontranslationPairs

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