Degree in the full nontranslation collision graph
ProvedCouret.STROBO2TORS.nontranslationGraph_degreecouret-programmecouret-unification-20261108
Let be a finite abelian group, , , , , and . Write for the ordered pair-sum count of a finite support , , , and . Ordinary full fibres have size , exceptional full fibres size . All displayed subtractions are natural subtraction, truncated at zero, and all quotients are integer division. In the graph joining nontranslation square-colliding triples, for every finite support ,
This connects the graph interface with explicit neighbours.
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 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_degree (S : Finset G) :
(nontranslationGraph (G := G)).degree S =
if hS : S.card = 3 then (nontranslatedNeighbours S).card else 0 := 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 29–43; source file SHA-256 9658a84461c5a4d77889dd76eb3dddcec15835d7b88366ad8625c7d4f9683325; theorem Couret.STROBO2TORS.nontranslationGraph_degree