Zero-containing supports in an exceptional fibre
ProvedCouret.STROBO2TORS.zeroContainingExceptionalSupports_preimagecouret-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 any exceptional fibre ,
Here the subscript means exceptional supports containing zero, not profile zero.
Preamble
import Aesop
import Definitions.Def_Couret_Strobo2TorsZeroFree_13701bff33aa
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_exceptionalFibres_preimage
import Definitions.Def_Couret_Strobo2TorsEnumeration_d0ac93e4ff30
import Mathlib.Algebra.BigOperators.Group.Finset.Sigma
set_option autoImplicit false
open scoped BigOperators
namespace Couret.STROBO2TORS
variable {G : Type*} [AddCommGroup G] [DecidableEq G]
section Finite
variable [Fintype G]
Formal statement
theorem zeroContainingExceptionalSupports_preimage (F : Finset (Finset G))
(hF : F ∈ (exceptionalFibres : Finset (Finset (Finset G)))) :
zeroContainingExceptionalSupports.filter (fun S : Finset G => squareFibre S = F) =
F.filter (fun S => 0 ∈ S) := 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/Strobo2TorsZeroFree.lean, lines 232–250; source file SHA-256 5b8447d710c8e734bf9ff71c397ece8eebe34e569041c803c65dea8a9c580a24; theorem Couret.STROBO2TORS.zeroContainingExceptionalSupports_preimage