Mixed-matched doubles yield an augmented sum matching
ProvedCouret.InterIA.SingletonNecessity.mixed_count_cancellationcouret-programmecouret-unification-20261108
For a finite subset of an abelian group, let . Let be an abelian group, and let be such that are pairwise distinct. Put , , , and . If , , , and , then
The added terms account for the internally matched diagonal pairs.
Preamble
import Definitions.Def_Couret_ExtractionBasics_37ec1603f738
import Definitions.Def_Couret_SixDoublePairing_42d09f1cbb6a
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.BigOperators.Ring.Finset
import Mathlib.Algebra.Group.Pi.Basic
import Mathlib.Data.Finset.Insert
import Mathlib.Data.Finset.Prod
import Mathlib.Data.Finset.SymmDiff
import Mathlib.Data.Fintype.Pi
import Mathlib.Data.Int.Basic
import Mathlib.Data.List.Permutation
import Mathlib.Data.ZMod.Basic
import Mathlib.Tactic.Abel
import Mathlib.Tactic.FinCases
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Ring
import Mathlib.Tactic.Tauto
import Theorems.Thm_Couret_InterIA_SingletonNecessity_square_supportLeft
import Theorems.Thm_Couret_InterIA_SingletonNecessity_square_supportRight
import Definitions.Def_Couret_ExtractionBasics_37ec1603f738
import Definitions.Def_Couret_SixDoublePairing_42d09f1cbb6a
set_option autoImplicit false
namespace Couret.InterIA.SingletonNecessity
open Couret.InterIA.Parity
variable {G : Type*} [AddCommGroup G] [DecidableEq G]
Formal statement
theorem mixed_count_cancellation (x : Fin 6 → G) (hd : SevenDistinct x)
(hx : MixedDoubles x)
(hs : ∀ z, orderedSquare (supportLeft x) z=orderedSquare (supportRight x) z) :
(sumTermsLeft x ++ [x 0+x 0]).Perm (sumTermsRight x ++ [x 3+x 3]) := by sorry
end Couret.InterIA.SingletonNecessity
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 source-tree/research/interia/abelian-singleton-necessity-20261104/formal/CountCancellation.lean, lines 20–32; source file SHA-256 a9c6879b38b272efd97ab8636f1963a931fe668d255d7f044d96fb16a8dc1e89; theorem Couret.InterIA.SingletonNecessity.mixed_count_cancellation