Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Number of observed zero-free fibres when two-torsion has size at least four

Proved
Couret.STROBO2TORS.zeroFreeFullFibres_card_numeric_of_four

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]={x:2x=0}H=G[2]=\{x:2x=0\}H=G[2]={x:2x=0}, K=G[3]={x:3x=0}K=G[3]=\{x:3x=0\}K=G[3]={x:3x=0}, n=∣G∣n=|G|n=∣G∣, h=∣H∣h=|H|h=∣H∣, and t=∣K∣t=|K|t=∣K∣. For a finite support SSS, let QS(z)Q_S(z)QS​(z) count ordered pairs in S2S^2S2 with sum zzz, let F(S)F(S)F(S) be its fibre among three-element supports, and put S+u={x+u:x∈S}S+u=\{x+u:x\in S\}S+u={x+u:x∈S}. If h≥4h\ge4h≥4, then

∣F∘∣=(n3)/h−(n/h)(h−1)((t−1)/2).|\mathcal F^\circ|=\binom n3/h-(n/h)(h-1)((t-1)/2).∣F∘∣=(3n​)/h−(n/h)(h−1)((t−1)/2).

The family consists of nonempty zero-free parts of full square fibres, with repetitions removed; arithmetic is in the natural numbers.

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_exceptionalFibres_card_numeric
import Theorems.Thm_Couret_STROBO2TORS_tripleSupports_weighted_card
import Theorems.Thm_Couret_STROBO2TORS_twoTorsion_card_pos
import Theorems.Thm_Couret_STROBO2TORS_zeroFreeFullFibres_card_of_four
import Definitions.Def_Couret_Strobo2TorsZeroFreeAll_270e04a89080

set_option autoImplicit false

namespace Couret.STROBO2TORS

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

section Finite

variable [Fintype G]













Formal statement

theorem zeroFreeFullFibres_card_numeric_of_four
    (hh : 4 ≤ (twoTorsion : Finset G).card) :
    (zeroFreeFullFibres : Finset (Finset (Finset G))).card =
      (Fintype.card G).choose 3 / (twoTorsion : Finset G).card -
        ((Fintype.card G / (twoTorsion : Finset G).card) *
          ((twoTorsion : Finset G).card - 1) *
          (((threeTorsion : Finset G).card - 1) / 2)) := 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/Strobo2TorsSurvivalCounts.lean, lines 103–113; source file SHA-256 eb83aad035d165b4936c91ba5553308053fd7af14d21de79283c272887a1f571; theorem Couret.STROBO2TORS.zeroFreeFullFibres_card_numeric_of_four

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