Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The exact maximum observed zero-free fibre size

Proved
Couret.STROBO2TORS.maxObservedZeroFreeFibreSize_complete

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 MMM be the maximum cardinality of a nonempty zero-free triple square fibre, with maximum zero if none exist. Test the following conditions in order:

M={0N<4,1N≥4, h=1,h−3N≥4, h≠1, D=1,1earlier cases fail and N=4,hearlier cases fail and t=1,2h−2earlier cases fail and D≤3,2hotherwise.M=\begin{cases}0&N<4,\\1&N\ge4,\ h=1,\\h-3&N\ge4,\ h\ne1,\ D=1,\\1&\text{earlier cases fail and }N=4,\\h&\text{earlier cases fail and }t=1,\\2h-2&\text{earlier cases fail and }D\le3,\\2h&\text{otherwise}.\end{cases}M=⎩⎨⎧​01h−31h2h−22h​N<4,N≥4, h=1,N≥4, h=1, D=1,earlier cases fail and N=4,earlier cases fail and t=1,earlier cases fail and D≤3,otherwise.​

The ordered branches preserve the small-group boundary cases.

Preamble
import Aesop
import Definitions.Def_Couret_Strobo2TorsSharpMaximum_bfb30eac9be9
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_maxObservedZeroFreeFibreSize_eq_h_sub_three_of_q_one
import Theorems.Thm_Couret_STROBO2TORS_maxObservedZeroFreeFibreSize_eq_one_of_card_four
import Theorems.Thm_Couret_STROBO2TORS_maxObservedZeroFreeFibreSize_eq_one_of_trivial_two_torsion
import Theorems.Thm_Couret_STROBO2TORS_maxObservedZeroFreeFibreSize_eq_zero_of_card_lt_four
import Theorems.Thm_Couret_STROBO2TORS_mem_threeTorsion
import Theorems.Thm_Couret_STROBO2TORS_outsideTwoTorsion_card_ge_three_of_large_quotient
import Theorems.Thm_Couret_STROBO2TORS_twoTorsion_card_pos
import Theorems.Thm_Couret_STROBO2TORS_zeroFreeFullFibres_card_le_h_of_no_three_torsion
import Theorems.Thm_Couret_STROBO2TORS_zeroFreeFullFibres_card_le_reduced_of_q_le_three
import Theorems.Thm_Couret_STROBO2TORS_zeroFreeFullFibres_card_le_two_torsion
import Theorems.Thm_Couret_STROBO2TORS_zeroFreeFullFibres_reduced_size_exists
import Theorems.Thm_Couret_STROBO2TORS_zeroFreeFullFibres_size_h_exists_of_no_three_torsion
import Theorems.Thm_Couret_STROBO2TORS_zeroFreeFullFibres_top_size_nonempty_iff
import Definitions.Def_Couret_Strobo2TorsOrdinaryCount_88997e4d335a

set_option autoImplicit false

namespace Couret.STROBO2TORS

variable {G : Type*} [AddCommGroup G] [DecidableEq G] [Fintype G]







































Formal statement

theorem maxObservedZeroFreeFibreSize_complete :
    maxObservedZeroFreeFibreSize (G := G) =
      if Fintype.card G < 4 then 0
      else if (twoTorsion : Finset G).card = 1 then 1
      else if (doublingImages : Finset G).card = 1 then
        (twoTorsion : Finset G).card - 3
      else if Fintype.card G = 4 then 1
      else if (threeTorsion : Finset G).card = 1 then
        (twoTorsion : Finset G).card
      else if (doublingImages : Finset G).card ≤ 3 then
        2 * (twoTorsion : Finset G).card - 2
      else 2 * (twoTorsion : Finset G).card := by sorry



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/Strobo2TorsSharpMaximum.lean, lines 400–455; source file SHA-256 98c3b135eb2ea85402b9696299566a40098ac965175f8307832d30ec1e652733; theorem Couret.STROBO2TORS.maxObservedZeroFreeFibreSize_complete

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