The coefficient backend equals exact decoding
ProvedCouret.STROBO2TORS.recoh_coefficient_backend_decoder_eq_exactLet be a finite abelian group. For a character write , and for a bank write , where counts ordered pairs from summing to . The exact decoder of consists of all three-element supports with . Let be a finite measurement index set and any coordinate index set. Let be additive and let . Let , , and suppose implies . A halving function is sound when every returned satisfies , and complete when it returns some half whenever one exists. For every , let be prime, , and primitive of order . Let a support encoding satisfy for every finite , and let a sparse coefficient list have exponents below and value . Assume for , and for every three-set and . For a sound and complete halving function, the coefficient backend, which obtains translation signs from coefficient comparisons and then checks the full observation, satisfies
This identifies executable coefficient filtering with the semantic solution set.
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]
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