Nonzero three-torsion splits into sign pairs
ProvedCouret.STROBO2TORS.threeTorsion_nonzero_card_eq_two_pairscouret-programmecouret-unification-20261108
Let be a finite abelian group. Write , , , , , and . For a triple support , let be all three-element supports having the same ordered pair-sum counts, and . An ordinary fibre has size ; an exceptional fibre has size . For any fibre , put . Let . Then
This describes the finite triple-support square fibres.
Preamble
import Aesop
import Definitions.Def_Couret_Strobo2TorsEnumeration_d0ac93e4ff30
import Lean.Elab.Tactic.Omega
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Data.Finset.Powerset
import Mathlib.Data.Fintype.Card
import Mathlib.Tactic.Abel
import Mathlib.Tactic.Tauto
import Theorems.Thm_Couret_STROBO2TORS_mem_threeTorsion
import Theorems.Thm_Couret_STROBO2TORS_threeSignPairs_preimage
import Definitions.Def_Couret_Strobo2TorsCardinality_32b8061f8d58
import Mathlib.Data.Fintype.Card
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 threeTorsion_nonzero_card_eq_two_pairs :
(threeTorsion : Finset G).card - 1 = 2 * (threeSignPairs : Finset (Finset G)).card := 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/Strobo2TorsEnumeration.lean, lines 410–425; source file SHA-256 c5994a3923540d425df056cc4b93ff327cc2020eebfa6a424ceca158f26761bc; theorem Couret.STROBO2TORS.threeTorsion_nonzero_card_eq_two_pairs