Two-torsion intersections commute with two-torsion translations
ProvedCouret.STROBO2TORS.translateSupport_inter_twoTorsion_eq_imagecouret-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 a support and ,
This is exact finite-set equality.
Preamble
import Aesop
import Definitions.Def_Couret_Strobo2TorsZeroFreeAll_270e04a89080
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 Definitions.Def_Couret_Strobo2TorsZeroFree_13701bff33aa
set_option autoImplicit false
namespace Couret.STROBO2TORS
variable {G : Type*} [AddCommGroup G] [DecidableEq G]
section Finite
variable [Fintype G]
/-! ## Profile invariance under two-torsion translation
These statements are prerequisites for counting the ordinary fibres by
their number j of support elements in the two-torsion subgroup. They do
not by themselves prove the closed binomial formula. -/
Formal statement
theorem translateSupport_inter_twoTorsion_eq_image (S : Finset G) (u : G)
(hu : u ∈ (twoTorsion : Finset G)) :
translateSupport S u ∩ (twoTorsion : Finset G) =
(S ∩ (twoTorsion : Finset G)).image (fun x => x + u) := by sorry
/-! ## Binomial enumeration of profile supports -/
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/Strobo2TorsZeroFreeAll.lean, lines 301–318; source file SHA-256 57e0e6b2919f605519cfad328e82e56477cae03c002010fa3c4fd6a8c218120b; theorem Couret.STROBO2TORS.translateSupport_inter_twoTorsion_eq_image