Exceptional supports have three possible profiles
ProvedCouret.STROBO2TORS.exceptionalSupports_eq_three_profile_unioncouret-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 . Writing for exceptional supports meeting in points,
This exhausts all exceptional supports.
Preamble
import Aesop
import Definitions.Def_Couret_Strobo2TorsOrdinaryCount_88997e4d335a
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.Tauto
import Theorems.Thm_Couret_STROBO2TORS_exceptionalSupportsProfile_three_eq_empty
import Theorems.Thm_Couret_STROBO2TORS_mem_exceptionalSupports_card
import Theorems.Thm_Couret_STROBO2TORS_mem_tripleSupportsProfile
import Definitions.Def_Couret_Strobo2TorsOrdinaryCount_88997e4d335a
set_option autoImplicit false
namespace Couret.STROBO2TORS
variable {G : Type*} [AddCommGroup G] [DecidableEq G]
section Finite
variable [Fintype G]
Formal statement
theorem exceptionalSupports_eq_three_profile_union :
(exceptionalSupports : Finset (Finset G)) =
exceptionalSupportsProfile 0 ∪
(exceptionalSupportsProfile 1 ∪ exceptionalSupportsProfile 2) := 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/Strobo2TorsExceptionalZero.lean, lines 37–73; source file SHA-256 65617a4490b73497cb28359bad8f2b27cd3159569e95b4ec095e4f4604f5eca0; theorem Couret.STROBO2TORS.exceptionalSupports_eq_three_profile_union