Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The zero-free exceptional-fibre histogram

Proved
Couret.STROBO2TORS.zeroFreeExceptionalFibres_histogram_formula

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

couret-programmecouret-unification-20261108

Let GGG be a finite abelian group, N=∣G∣N=|G|N=∣G∣, H=G[2]={u:2u=0}H=G[2]=\{u:2u=0\}H=G[2]={u:2u=0}, h=∣H∣h=|H|h=∣H∣, t=∣G[3]∣t=|G[3]|t=∣G[3]∣, and D=∣2G∣D=|2G|D=∣2G∣. Write RS(z)R_S(z)RS​(z) for the ordered pair-sum count of a finite support SSS, F(S)={T:∣T∣=3,RT=RS}F(S)=\{T:|T|=3,R_T=R_S\}F(S)={T:∣T∣=3,RT​=RS​}, O(S)={S+u:u∈H}O(S)=\{S+u:u\in H\}O(S)={S+u:u∈H}, and F∗={S∈F:0∉S}F^*=\{S\in F:0\notin S\}F∗={S∈F:0∈/S}. Ordinary full fibres have size hhh, exceptional full fibres size 2h2h2h. All displayed subtractions are natural subtraction, truncated at zero, and all quotients are integer division. Let p=(t−1)/2p=(t-1)/2p=(t−1)/2 and E∗={F∗:F exceptional}\mathcal E^*=\{F^*:F\text{ exceptional}\}E∗={F∗:F exceptional}. For each k∈Nk\in\mathbb Nk∈N,

∣{R∈E∗:∣R∣=k}∣=1k=2h−23(h−1)p+1k=2h(D−3)(h−1)p.|\{R\in\mathcal E^*:|R|=k\}|=\mathbf1_{k=2h-2}3(h-1)p+\mathbf1_{k=2h}(D-3)(h-1)p.∣{R∈E∗:∣R∣=k}∣=1k=2h−2​3(h−1)p+1k=2h​(D−3)(h−1)p.

This formula includes k=0k=0k=0 and uses truncated natural subtraction.

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 Theorems.Thm_Couret_STROBO2TORS_twoTorsion_card_pos
import Theorems.Thm_Couret_STROBO2TORS_zeroFreeExceptionalFibres_full_card
import Theorems.Thm_Couret_STROBO2TORS_zeroFreeExceptionalFibres_only_two_sizes
import Theorems.Thm_Couret_STROBO2TORS_zeroFreeExceptionalFibres_reduced_card
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]































Formal statement

theorem zeroFreeExceptionalFibres_histogram_formula (k : ℕ) :
    ((zeroFreeExceptionalFibres : Finset (Finset (Finset G))).filter
      (fun R => R.card = k)).card =
    (if k = 2 * (twoTorsion : Finset G).card - 2 then
      3 * ((twoTorsion : Finset G).card - 1) *
        (threeSignPairs : Finset (Finset G)).card else 0) +
    (if k = 2 * (twoTorsion : Finset G).card then
      ((doublingImages : Finset G).card - 3) *
        ((twoTorsion : Finset G).card - 1) *
        (threeSignPairs : Finset (Finset G)).card else 0) := by sorry






/-! ## 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. -/















/-! ## 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 214–247; source file SHA-256 57e0e6b2919f605519cfad328e82e56477cae03c002010fa3c4fd6a8c218120b; theorem Couret.STROBO2TORS.zeroFreeExceptionalFibres_histogram_formula

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