Ordered pairs count each distance-two edge twice
ProvedCouret.STROBO2TORS.deltaTwoOrderedPairs_card_eq_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 . Let be the defined ordered-pair family and the ordinary collision graph with symmetric-difference size two. Then
Each edge is counted in both directions.
Preamble
import Aesop
import Definitions.Def_Couret_Strobo2TorsDeltaTwoCount_96c8f007ba6a
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.Finset.SymmDiff
import Mathlib.Data.Fintype.Card
import Mathlib.Tactic.Abel
import Mathlib.Tactic.Tauto
import Theorems.Thm_Couret_STROBO2TORS_deltaTwoOrderedPairs_iff_adj
import Definitions.Def_Couret_Strobo2TorsDeltaOrdinaryCount_91279c99d3e0
set_option autoImplicit false
open scoped BigOperators symmDiff
/-!
Exact count of the ordinary delta-two edges, with zero allowed.
Parameters (a,u,b) have u a nonzero element of G[2] and b outside
{a,a+u}. They represent the ordered pair
({a,a+u,b}, {a,a+u,b+u}). Each ordered pair has precisely two
parameters, according to the choice a or a+u in its common pair.
The graph handshake supplies the second factor of two.
-/
namespace Couret.STROBO2TORS
variable {G : Type*} [AddCommGroup G] [DecidableEq G]
variable [Fintype G]
attribute [local instance] Classical.propDecidable
Formal statement
theorem deltaTwoOrderedPairs_card_eq_twice_edges :
(deltaTwoOrderedPairs : Finset (Finset G × Finset G)).card =
2 * (ordinaryDeltaGraph (G := G) 2).edgeFinset.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/Strobo2TorsDeltaTwoCount.lean, lines 341–354; source file SHA-256 cb89a555428b446017e32cc8ccac7e557459a109f1144b64f2304523abb8127d; theorem Couret.STROBO2TORS.deltaTwoOrderedPairs_card_eq_twice_edges