Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The coefficient backend equals exact decoding

Proved
Couret.STROBO2TORS.recoh_coefficient_backend_decoder_eq_exact

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). Let III be a finite measurement index set and JJJ any coordinate index set. Let e:G[2]≅F2Je:G[2]\cong\mathbb F_2^Je:G[2]≅F2J​ be additive and let ι:J→I\iota:J\to Iι:J→I. Let U⊆GU\subseteq GU⊆G, R:G→NR:G\to\mathbb NR:G→N, and suppose R(z)≠0R(z)\ne0R(z)=0 implies z∈Uz\in Uz∈U. A halving function is sound when every returned σ\sigmaσ satisfies 2σ=t2\sigma=t2σ=t, and complete when it returns some half whenever one exists. For every iii, let pip_ipi​ be prime, ki∈Nk_i\in\mathbb Nki​∈N, and ζi\zeta_iζi​ primitive of order piki+1p_i^{k_i+1}piki​+1​. Let a support encoding Ei(B)E_i(B)Ei​(B) satisfy ∑a∈Ei(B)ζia=Pχi(B)\sum_{a\in E_i(B)}\zeta_i^a=P_{\chi_i}(B)∑a∈Ei​(B)​ζia​=Pχi​​(B) for every finite BBB, and let a sparse coefficient list TiT_iTi​ have exponents below (pi−1)piki(p_i-1)p_i^{k_i}(pi​−1)piki​​ and value oi=∑(a,c)∈Ticζiao_i=\sum_{(a,c)\in T_i}c\zeta_i^aoi​=∑(a,c)∈Ti​​cζia​. Assume χι(j)(u)=(−1)e(u)j\chi_{\iota(j)}(u)=(-1)^{e(u)_j}χι(j)​(u)=(−1)e(u)j​ for u∈G[2]u\in G[2]u∈G[2], and Pχι(j)(B)≠0P_{\chi_{\iota(j)}}(B)\ne0Pχι(j)​​(B)=0 for every three-set BBB and j∈Jj\in Jj∈J. For a sound and complete halving function, the coefficient backend, which obtains translation signs from coefficient comparisons and then checks the full observation, satisfies

CoefficientBackend⁡(U,R,h,ι,e,p,k,E,T)=ExactDecoder⁡(R,o).\operatorname{CoefficientBackend}(U,R,h,\iota,e,p,k,E,T)=\operatorname{ExactDecoder}(R,o).CoefficientBackend(U,R,h,ι,e,p,k,E,T)=ExactDecoder(R,o).

This identifies executable coefficient filtering with the semantic solution set.

Preamble
import Aesop
import Definitions.Def_Couret_RecohCoefficientDecoder_a5265698d3d8
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.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.RingTheory.Polynomial.Cyclotomic.Roots
import Mathlib.Tactic
import Mathlib.Tactic.Abel
import Mathlib.Tactic.Choose
import Mathlib.Tactic.FinCases
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Mathlib.Tactic.Tauto
import Theorems.Thm_Couret_STROBO2TORS_recoh_coefficient_observation_check_iff
import Theorems.Thm_Couret_STROBO2TORS_recoh_coefficient_sign_bools_exact
import Theorems.Thm_Couret_STROBO2TORS_recoh_indexed_checked_decoder_eq_exact
import Definitions.Def_Couret_RecohIndexedSignRecovery_d641979954b3
import Definitions.Def_Couret_RecohCoefficientObservations_4ffca285ab72

set_option autoImplicit false

/-!
The RECOH decoder with observed coefficients in the cyclotomic power basis.

The observed inputs are finite lists of exponent/integer-coefficient pairs,
as used by the Python observation format.  Candidate readings are generated
from root exponents and compared directly to those pairs.  No inverse map
from a coefficient polynomial to a list of roots is required.

The binary probes are selected inside the same full bank and use the same
observed inputs.  Their index type is arbitrary, allowing the actual subtype
of even cyclic coordinates rather than a noncomputable reindexing to Fin r.
-/

namespace Couret.STROBO2TORS

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

local notation "H₂" => recohTorsionSubgroup (G := G) 2





variable [Fintype I]



Formal statement

theorem recoh_coefficient_backend_decoder_eq_exact [Fintype G]
    (U : Finset G) (R : G → ℕ) (half : G → Option G)
    (index : J → I) (e : H₂ ≃+ (J → ZMod 2))
    (p k : I → ℕ) (enc : I → Finset G → List ℕ)
    (obsTerms : I → RecohSparseTerms)
    (bank : I → AddChar G ℂ) (ζ obs : I → ℂ)
    (hhalf : RecohHalfSolverSpec half)
    (hR : ∀ z, R z ≠ 0 → z ∈ U)
    (hp : ∀ i, (p i).Prime)
    (hζ : ∀ i, IsPrimitiveRoot (ζ i) ((p i) ^ (k i + 1)))
    (hred : ∀ i, RecohCoefficientsReduced (p i) (k i) (obsTerms i))
    (henc : ∀ i B, ((enc i B).map ((ζ i) ^ ·)).sum = recohSupportProbe (bank i) B)
    (hobs : ∀ i, recohCoefficientValue (ζ i) (obsTerms i) = obs i)
    (hcoord : ∀ (u : H₂) (j : J),
      bank (index j) (u : G) = if e u j = 0 then 1 else -1)
    (hnonzero : ∀ j (B : Finset G), B.card = 3 →
      recohSupportProbe (bank (index j)) B ≠ 0) :
    recohCoefficientBackendDecoder U R half index e p k enc obsTerms =
      recohExactDecoder bank (R, obs) := 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/RecohCoefficientDecoder.lean, lines 64–96; source file SHA-256 27e6ca1e00cd46d60a305c7e6828a88f59094d0e4574249284c628a6c98d5074; theorem Couret.STROBO2TORS.recoh_coefficient_backend_decoder_eq_exact

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