Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Weighted exceptional-fibre count

Proved
Couret.STROBO2TORS.exceptionalFibres_weighted_card

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]={u:2u=0}H=G[2]=\{u:2u=0\}H=G[2]={u:2u=0}, K=G[3]={v:3v=0}K=G[3]=\{v:3v=0\}K=G[3]={v:3v=0}, h=∣H∣h=|H|h=∣H∣, t=∣K∣t=|K|t=∣K∣, n=∣G∣n=|G|n=∣G∣, and q=∣2G∣q=|2G|q=∣2G∣. For a triple support SSS, let F(S)\mathcal F(S)F(S) be all three-element supports having the same ordered pair-sum counts, and O(S)={S+u:u∈H}\mathcal O(S)=\{S+u:u\in H\}O(S)={S+u:u∈H}. An ordinary fibre has size hhh; an exceptional fibre has size 2h2h2h. For any fibre FFF, put F∘={S∈F:0∉S}F^\circ=\{S\in F:0\notin S\}F∘={S∈F:0∈/S}. If E\mathcal EE denotes the exceptional fibres, then

2h∣E∣=n(h−1)(t−1).2h|\mathcal E|=n(h-1)(t-1).2h∣E∣=n(h−1)(t−1).

This describes the finite triple-support square fibres.

Preamble
import Aesop
import Definitions.Def_Couret_Strobo2TorsEnumeration_d0ac93e4ff30
import Lean.Elab.Tactic.Omega
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Data.Finset.Powerset
import Mathlib.Data.Fintype.Card
import Mathlib.Tactic.Abel
import Mathlib.Tactic.Tauto
import Theorems.Thm_Couret_STROBO2TORS_exceptionalFibres_member_card
import Theorems.Thm_Couret_STROBO2TORS_exceptionalFibres_preimage
import Theorems.Thm_Couret_STROBO2TORS_exceptionalSupports_card
import Definitions.Def_Couret_Strobo2TorsCardinality_32b8061f8d58
import Mathlib.Data.Fintype.Card

set_option autoImplicit false

open scoped BigOperators

namespace Couret.STROBO2TORS

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















section Finite

variable [Fintype G]

































Formal statement

theorem exceptionalFibres_weighted_card :
    (2 * (twoTorsion : Finset G).card) *
      (exceptionalFibres : Finset (Finset (Finset G))).card =
      Fintype.card G * ((twoTorsion : Finset G).card - 1) * ((threeTorsion : Finset G).card - 1) := 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/Strobo2TorsEnumeration.lean, lines 279–298; source file SHA-256 c5994a3923540d425df056cc4b93ff327cc2020eebfa6a424ceca158f26761bc; theorem Couret.STROBO2TORS.exceptionalFibres_weighted_card

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