Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Two suitable character banks reconstruct triples from the square

Proved
Couret.STROBO2TORS.recoh_observation_injective_of_separating_banks

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

couret-programmecouret-unification-20261108

Let GGG be an abelian group, RS(z)R_S(z)RS​(z) the ordered pair-sum count of a support SSS, Pχ(S)=∑s∈Sχ(s)P_\chi(S)=\sum_{s\in S}\chi(s)Pχ​(S)=∑s∈S​χ(s), and F(S)={T:∣T∣=3,RT=RS}F(S)=\{T:|T|=3,R_T=R_S\}F(S)={T:∣T∣=3,RT​=RS​}. Put H=G[2]H=G[2]H=G[2]. Let αi\alpha_iαi​ and βj\beta_jβj​ be complex character banks indexed by arbitrary types I,JI,JI,J. Assume each Pαi(S)≠0P_{\alpha_i}(S)\ne0Pαi​​(S)=0 on every triple; the common α\alphaα kernel on G[2]G[2]G[2] is trivial; every βj\beta_jβj​ is trivial on G[2]G[2]G[2]; and the common β\betaβ kernel on G[3]G[3]G[3] is trivial. Then

S⟼(RS,(Pαi(S))i,(Pβj(S))j)is injective on three-element supports.S\longmapsto(R_S,(P_{\alpha_i}(S))_i,(P_{\beta_j}(S))_j)\quad\text{is injective on three-element supports}.S⟼(RS​,(Pαi​​(S))i​,(Pβj​​(S))j​)is injective on three-element supports.

Neither the group nor the index types need be finite.

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_reconstruction_of_separating_banks
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_observation_injective_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) :
    Function.Injective (fun S : {S : Finset G // S.card = 3} =>
      recohObservation (Sum.elim bank2 bank3) S.1) := 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 193–210; source file SHA-256 513a4060ff87ff1fa62542ec6ee81bb251e2eebfa05d359dd9f60f5fb115b612; theorem Couret.STROBO2TORS.recoh_observation_injective_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