Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exact criterion for attaining the largest zero-free fibre size

Proved
Couret.STROBO2TORS.zeroFreeFullFibres_top_size_nonempty_iff

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. There exists a nonempty zero-free full triple square fibre of size 2h2h2h exactly when

D>3,h>1,t>1.D>3,\qquad h>1,\qquad t>1.D>3,h>1,t>1.

All three conditions are necessary.

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_zeroFreeExceptionalFibres_full_nonempty_iff
import Theorems.Thm_Couret_STROBO2TORS_zeroFreeFullFibres_top_filter_eq_exceptional
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_top_size_nonempty_iff :
    ((zeroFreeFullFibres : Finset (Finset (Finset G))).filter
      (fun R => R.card = 2 * (twoTorsion : Finset G).card)).Nonempty ↔
      3 < (doublingImages : Finset G).card ∧
      1 < (twoTorsion : Finset G).card ∧
      1 < (threeTorsion : 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/Strobo2TorsMaximum.lean, lines 71–81; source file SHA-256 27aa6c02d9eb6f3a53aeb5b66640fa36aa2dc35441d6179ac79eb791d573ade2; theorem Couret.STROBO2TORS.zeroFreeFullFibres_top_size_nonempty_iff

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