Nontranslation edges from exceptional supports
ProvedCouret.STROBO2TORS.nontranslationGraph_twice_edgescouret-programmecouret-unification-20261108
Let be a finite abelian group. Write , , , , and . For a finite support , let count ordered pairs in with sum , let be its fibre among three-element supports, and put . For the full nontranslation collision graph ,
The factor two converts ordered adjacency into edges.
Preamble
import Aesop
import Definitions.Def_Couret_Strobo2TorsNontranslationUnordered_7692bff20374
import Lean.Elab.Tactic.Omega
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Combinatorics.SimpleGraph.DegreeSum
import Mathlib.Data.Finset.Powerset
import Mathlib.Data.Fintype.Card
import Mathlib.Tactic.Abel
import Mathlib.Tactic.Tauto
import Theorems.Thm_Couret_STROBO2TORS_directed_nontranslation_degree_sum
import Theorems.Thm_Couret_STROBO2TORS_mem_tripleSupports
import Theorems.Thm_Couret_STROBO2TORS_nontranslationGraph_degree
import Definitions.Def_Couret_Strobo2TorsNontranslationSymmetry_29c4a2e9c2a5
import Mathlib.Combinatorics.SimpleGraph.DegreeSum
set_option autoImplicit false
open scoped BigOperators
namespace Couret.STROBO2TORS
variable {G : Type*} [AddCommGroup G] [DecidableEq G] [Fintype G]
Formal statement
theorem nontranslationGraph_twice_edges :
2 * (nontranslationGraph (G := G)).edgeFinset.card =
(exceptionalSupports : Finset (Finset G)).card *
(twoTorsion : Finset G).card := by sorry
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/Strobo2TorsNontranslationUnordered.lean, lines 45–77; source file SHA-256 9658a84461c5a4d77889dd76eb3dddcec15835d7b88366ad8625c7d4f9683325; theorem Couret.STROBO2TORS.nontranslationGraph_twice_edges