Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Closed histogram of zero-free fibre sizes

Proved
Couret.STROBO2TORS.zeroFreeFullFibres_histogram_closed

by alexcour · Nov 8, 2026 · Mathlib c5ea003 (Lean v4.30.0)

couret-programmecouret-unification-20261108

Let GGG be a finite abelian group. Write H=G[2]={u:2u=0}H=G[2]=\{u:2u=0\}H=G[2]={u:2u=0}, K=G[3]={v:3v=0}K=G[3]=\{v:3v=0\}K=G[3]={v:3v=0}, h=∣H∣h=|H|h=∣H∣, t=∣K∣t=|K|t=∣K∣, n=∣G∣n=|G|n=∣G∣, and q=∣2G∣q=|2G|q=∣2G∣. For a triple support SSS, let F(S)\mathcal F(S)F(S) be all three-element supports having the same ordered pair-sum counts, and O(S)={S+u:u∈H}\mathcal O(S)=\{S+u:u\in H\}O(S)={S+u:u∈H}. An ordinary fibre has size hhh; an exceptional fibre has size 2h2h2h. For any fibre FFF, put F∘={S∈F:0∉S}F^\circ=\{S\in F:0\notin S\}F∘={S∈F:0∈/S}. Let Z\mathcal ZZ be the family of observed nonempty zero-free full fibres and let k>0k>0k>0. Set s=(t−1)/2s=(t-1)/2s=(t−1)/2 and define e0=(n−2h)(h−1)(t−1)e_0=(n-2h)(h-1)(t-1)e0​=(n−2h)(h−1)(t−1), e1=e2=h(h−1)(t−1)e_1=e_2=h(h-1)(t-1)e1​=e2​=h(h−1)(t−1), e3=0e_3=0e3​=0, and aj=((hj)(n−h3−j)−ej)/ha_j=(\binom hj\binom{n-h}{3-j}-e_j)/haj​=((jh​)(3−jn−h​)−ej​)/h for 0≤j≤30\le j\le30≤j≤3. Then

#{R∈Z:∣R∣=k}=∑j=03[k=h−j]aj+[k=2h−2]3(h−1)s+[k=2h](n/h−3)(h−1)s.\#\{R\in\mathcal Z:|R|=k\}=\sum_{j=0}^3[k=h-j]a_j+[k=2h-2]3(h-1)s+[k=2h](n/h-3)(h-1)s.#{R∈Z:∣R∣=k}=j=0∑3​[k=h−j]aj​+[k=2h−2]3(h−1)s+[k=2h](n/h−3)(h−1)s.

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

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me