Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Supports in an observed zero-free fibre are zero-free triples

Proved
Couret.STROBO2TORS.zeroFreeFullFibres_support_card_and_zero

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}. For F∈F∘F\in\mathcal F^\circF∈F∘ and S∈FS\in FS∈F,

∣S∣=3,0∉S.|S|=3,\qquad0\notin S.∣S∣=3,0∈/S.

This unpacks the support constraints after fibre restriction.

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 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_support_card_and_zero
    (F : Finset (Finset G))
    (hF : F ∈ (zeroFreeFullFibres : Finset (Finset (Finset G))))
    (S : Finset G) (hS : S ∈ F) :
    S.card = 3 ∧ 0 ∉ S := 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/Strobo2TorsMaximumCases.lean, lines 198–215; source file SHA-256 1bfee4188b3c47a03a161a1e69038d93494311971f5cf01ae94bd27298727282; theorem Couret.STROBO2TORS.zeroFreeFullFibres_support_card_and_zero

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