Closed histogram of zero-free fibre sizes
ProvedCouret.STROBO2TORS.zeroFreeFullFibres_histogram_closedcouret-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 be the family of observed nonempty zero-free full fibres and let . Set and define , , , and for . Then
Brackets are indicators. All subtractions and divisions in these definitions use natural-number arithmetic, including truncation at zero.
This describes the finite triple-support square fibres.
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_doublingImages_card_division
import Theorems.Thm_Couret_STROBO2TORS_ordinaryFibresProfile_card_one_numeric
import Theorems.Thm_Couret_STROBO2TORS_ordinaryFibresProfile_card_three
import Theorems.Thm_Couret_STROBO2TORS_ordinaryFibresProfile_card_two_numeric
import Theorems.Thm_Couret_STROBO2TORS_ordinaryFibresProfile_card_zero_numeric
import Theorems.Thm_Couret_STROBO2TORS_ordinaryFibres_histogram_by_profile
import Theorems.Thm_Couret_STROBO2TORS_threeSignPairs_card_division
import Theorems.Thm_Couret_STROBO2TORS_zeroFreeFullFibres_histogram_semi_numeric
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 zeroFreeFullFibres_histogram_closed (k : ℕ) (hk : 0 < k) :
((zeroFreeFullFibres : Finset (Finset (Finset G))).filter
(fun R => R.card = k)).card =
(if (twoTorsion : Finset G).card = k then
(((twoTorsion : Finset G).card.choose 0) *
((Fintype.card G - (twoTorsion : Finset G).card).choose 3) -
((Fintype.card G - 2 * (twoTorsion : Finset G).card) *
((twoTorsion : Finset G).card - 1) *
((threeTorsion : Finset G).card - 1))) /
(twoTorsion : Finset G).card else 0) +
(if (twoTorsion : Finset G).card - 1 = k then
(((twoTorsion : Finset G).card.choose 1) *
((Fintype.card G - (twoTorsion : Finset G).card).choose 2) -
((twoTorsion : Finset G).card *
((twoTorsion : Finset G).card - 1) *
((threeTorsion : Finset G).card - 1))) /
(twoTorsion : Finset G).card else 0) +
(if (twoTorsion : Finset G).card - 2 = k then
(((twoTorsion : Finset G).card.choose 2) *
((Fintype.card G - (twoTorsion : Finset G).card).choose 1) -
((twoTorsion : Finset G).card *
((twoTorsion : Finset G).card - 1) *
((threeTorsion : Finset G).card - 1))) /
(twoTorsion : Finset G).card else 0) +
(if (twoTorsion : Finset G).card - 3 = k then
((twoTorsion : Finset G).card.choose 3) /
(twoTorsion : Finset G).card else 0) +
(if k = 2 * (twoTorsion : Finset G).card - 2 then
3 * ((twoTorsion : Finset G).card - 1) *
(((threeTorsion : Finset G).card - 1) / 2) else 0) +
(if k = 2 * (twoTorsion : Finset G).card then
((Fintype.card G / (twoTorsion : Finset G).card) - 3) *
((twoTorsion : Finset G).card - 1) *
(((threeTorsion : Finset G).card - 1) / 2) else 0) := 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/Strobo2TorsHistogram.lean, lines 182–226; source file SHA-256 c12ab039c6b1ab4ff961876e1b2df183771e0e7ecfaff3c058cae2eec9da35b0; theorem Couret.STROBO2TORS.zeroFreeFullFibres_histogram_closed