Membership in the ordered nontranslation collision list
ProvedCouret.STROBO2TORS.mem_orderedNontranslationPairscouret-programmecouret-unification-20261108
Let be a finite abelian group and finite. Write , retaining ordered pairs and diagonals. Let be the finite enumeration obtained by filtering all ordered pairs of three-element supports by the nontranslation-collision predicate. Then
Here . 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