Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Two separating primary banks reconstruct a triple

Proved
Couret.STROBO2TORS.recoh_reconstruction_of_separating_banks

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

couret-programmecouret-unification-20261108

Let GGG be an abelian group, H=G[2]H=G[2]H=G[2], K=G[3]K=G[3]K=G[3], and Pχ(S)=∑x∈Sχ(x)P_\chi(S)=\sum_{x\in S}\chi(x)Pχ​(S)=∑x∈S​χ(x) for a complex additive character χ\chiχ (so χ(x+y)=χ(x)χ(y)\chi(x+y)=\chi(x)\chi(y)χ(x+y)=χ(x)χ(y)). Write QSQ_SQS​ for ordered-sum counts and OB(S)=(QS,(Pχi(S))i)\mathcal O_B(S)=(Q_S,(P_{\chi_i}(S))_i)OB​(S)=(QS​,(Pχi​​(S))i​) for a bank B=(χi)B=(\chi_i)B=(χi​). Let banks B2=(χi)B_2=(\chi_i)B2​=(χi​) and B3=(ψj)B_3=(\psi_j)B3​=(ψj​) have arbitrary index types. Assume every χi\chi_iχi​ has nonzero probe on every three-element support; their common kernel on HHH is zero; every ψj\psi_jψj​ is trivial on HHH; and their common kernel on KKK is zero. For three-element supports S,TS,TS,T, if QS=QTQ_S=Q_TQS​=QT​ and all readings of both banks agree, then

S=T.S=T.S=T.

Finiteness of GGG is not required.

Preamble
import Aesop
import Definitions.Def_Couret_RecohReconstruction_b9109c17baa8
import Lean.Elab.Tactic.Omega
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.Group.AddChar
import Mathlib.Data.Complex.Basic
import Mathlib.Data.Finset.Powerset
import Mathlib.Data.Fintype.Card
import Mathlib.Tactic.Abel
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_third_probe_separates_exceptional
import Definitions.Def_Couret_Strobo2TorsEnumeration_d0ac93e4ff30
import Mathlib.Algebra.Group.AddChar
import Mathlib.Data.Complex.Basic
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring

set_option autoImplicit false

/-!
RECOH: reconstructing a cardinality-three support from its labelled ordered
square and a fixed bank of individual complex character coefficients.

The observation and the support cardinality are explicit. The classification
used below is the existing STROBO theorem, not an additional hypothesis.
-/

namespace Couret.STROBO2TORS

open scoped BigOperators

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













Formal statement

theorem recoh_reconstruction_of_separating_banks
    {I J : Type*} (bank2 : I → AddChar G ℂ) (bank3 : J → AddChar G ℂ)
    (hnonzero : ∀ i : I, ∀ S : Finset G, S.card = 3 →
      recohSupportProbe (bank2 i) S ≠ 0)
    (hsep2 : ∀ u : G, u + u = 0 → (∀ i : I, bank2 i u = 1) → u = 0)
    (htrivial2 : ∀ j : J, ∀ u : G, u + u = 0 → bank3 j u = 1)
    (hsep3 : ∀ v : G, (v + v) + v = 0 → (∀ j : J, bank3 j v = 1) → v = 0)
    (S T : Finset G) (hS : S.card = 3) (hT : T.card = 3)
    (hsquare : ∀ z : G, orderedSquare S z = orderedSquare T z)
    (hprobe2 : ∀ i : I, recohSupportProbe (bank2 i) S = recohSupportProbe (bank2 i) T)
    (hprobe3 : ∀ j : J, recohSupportProbe (bank3 j) S = recohSupportProbe (bank3 j) T) :
    S = T := 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/RecohReconstruction.lean, lines 148–185; source file SHA-256 513a4060ff87ff1fa62542ec6ee81bb251e2eebfa05d359dd9f60f5fb115b612; theorem Couret.STROBO2TORS.recoh_reconstruction_of_separating_banks

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