Groups of size at most three have no zero-free triple fibres
ProvedCouret.STROBO2TORS.zeroFreeFullFibres_eq_empty_of_card_le_threecouret-programmecouret-unification-20261108
Let be a finite abelian group, , , , , and . Write for the ordered pair-sum count of a finite support , , , and . Ordinary full fibres have size , exceptional full fibres size . All displayed subtractions are natural subtraction, truncated at zero, and all quotients are integer division. If , then
where is the collection of nonempty zero-free full triple square fibres.
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_zeroFreeFullFibres_support_card_and_zero
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_eq_empty_of_card_le_three
(hn : Fintype.card G ≤ 3) :
(zeroFreeFullFibres : Finset (Finset (Finset G))) = ∅ := 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 217–236; source file SHA-256 1bfee4188b3c47a03a161a1e69038d93494311971f5cf01ae94bd27298727282; theorem Couret.STROBO2TORS.zeroFreeFullFibres_eq_empty_of_card_le_three