Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

An exceptional fibre can be separated by one extra character

Proved
Couret.STROBO2TORS.recoh_exists_bank_on_exceptional_fibre

by alexcour · Nov 8, 2026 · Mathlib c5ea003 (Lean v4.30.0)

couret-programmecouret-unification-20261108

Let GGG be a finite abelian group. For a character χ:G→C\chi:G\to\mathbb Cχ:G→C write Pχ(S)=∑x∈Sχ(x)P_\chi(S)=\sum_{x\in S}\chi(x)Pχ​(S)=∑x∈S​χ(x), and for a bank (χi)(\chi_i)(χi​) write Obs⁡(S)=(QS,(Pχi(S))i)\operatorname{Obs}(S)=(Q_S,(P_{\chi_i}(S))_i)Obs(S)=(QS​,(Pχi​​(S))i​), where QS(z)Q_S(z)QS​(z) counts ordered pairs from SSS summing to zzz. The exact decoder of (R,o)(R,o)(R,o) consists of all three-element supports SSS with Obs⁡(S)=(R,o)\operatorname{Obs}(S)=(R,o)Obs(S)=(R,o). Assume ∣G[2]∣=2r|G[2]|=2^r∣G[2]∣=2r and let SSS have three elements with ∣F(S)∣=2∣G[2]∣|\mathcal F(S)|=2|G[2]|∣F(S)∣=2∣G[2]∣. There is a bank of r+1r+1r+1 complex characters for which

T⟼(Pχi(T))i<r+1 is injective on F(S).T\longmapsto(P_{\chi_i}(T))_{i<r+1}\text{ is injective on }\mathcal F(S).T⟼(Pχi​​(T))i<r+1​ is injective on F(S).

This is a fibre-specific bank, with the square data already fixed.

Preamble
import Aesop
import Definitions.Def_Couret_RecohOptimalBank_e8b60aaa0883
import Lean.Elab.Tactic.Omega
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.Field.ZMod
import Mathlib.Algebra.Group.AddChar
import Mathlib.Algebra.Module.ZMod
import Mathlib.Analysis.Complex.Basic
import Mathlib.Analysis.SpecialFunctions.Complex.CircleAddChar
import Mathlib.Data.Complex.Basic
import Mathlib.Data.Finite.Card
import Mathlib.Data.Finset.Card
import Mathlib.Data.Finset.Powerset
import Mathlib.Data.Fintype.BigOperators
import Mathlib.Data.Fintype.Card
import Mathlib.Data.Nat.Factorization.Basic
import Mathlib.Data.ZMod.Basic
import Mathlib.FieldTheory.Finiteness
import Mathlib.GroupTheory.FiniteAbelian.Duality
import Mathlib.LinearAlgebra.Dimension.Constructions
import Mathlib.LinearAlgebra.Dimension.Finite
import Mathlib.LinearAlgebra.Dual.Lemmas
import Mathlib.LinearAlgebra.LinearIndependent.Lemmas
import Mathlib.Tactic.Abel
import Mathlib.Tactic.Choose
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Mathlib.Tactic.Tauto
import Theorems.Thm_Couret_STROBO2TORS_recoh_exceptional_normal_form
import Theorems.Thm_Couret_STROBO2TORS_recoh_exists_bank_on_param_fibre
import Theorems.Thm_Couret_STROBO2TORS_squareFibre_card_two_h_iff_exception
import Definitions.Def_Couret_RecohOptimalBank_e8b60aaa0883
import Mathlib.Data.Finite.Card

set_option autoImplicit false

/-!
Character banks chosen after the labelled ordered square has been observed.
The bank may depend on the complete square fibre, but is fixed on that fibre.
The ordinary fibre needs the two-torsion rank many character slots.  An
exceptional fibre needs at most one additional character slot, independently
of the three-torsion rank of the ambient finite abelian group.
-/

namespace Couret.STROBO2TORS

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













Formal statement

theorem recoh_exists_bank_on_exceptional_fibre
    (r : ℕ)
    (hcard2 : Nat.card (recohTorsionSubgroup (G := G) 2) = 2 ^ r)
    (S : Finset G) (hS : S.card = 3)
    (hexceptional : (squareFibre S).card = 2 * (twoTorsion : Finset G).card) :
    ∃ bank : Fin (r + 1) → AddChar G ℂ,
      Set.InjOn (fun T : Finset G => fun i => recohSupportProbe (bank i) T)
        (squareFibre S) := by sorry




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/RecohFibreUpper.lean, lines 184–198; source file SHA-256 682ad74687cb91c6b5c8d4f92be42d438a63b3a643e0e0c7a5093423d4d3efdc; theorem Couret.STROBO2TORS.recoh_exists_bank_on_exceptional_fibre

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