The parity coefficient backend equals exact decoding
ProvedCouret.STROBO2TORS.recoh_parity_coefficient_backend_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 parity representative backend followed by indexed coefficient-sign recovery and final observation filtering satisfies
Thus the parity candidate reduction preserves the complete semantic solution set.
import Aesop
import Definitions.Def_Couret_RecohParityDecoder_e5701300ff06
import Lean.Elab.Tactic.Omega
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.BigOperators.Group.Finset.Piecewise
import Mathlib.Algebra.BigOperators.Group.Finset.Sigma
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.Multiset.Sort
import Mathlib.Data.Nat.Factorization.Basic
import Mathlib.Data.Nat.Log
import Mathlib.Data.ZMod.Basic
import Mathlib.FieldTheory.Finiteness
import Mathlib.GroupTheory.FiniteAbelian.Duality
import Mathlib.GroupTheory.SpecificGroups.Cyclic
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.RingTheory.RootsOfUnity.Complex
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_boolean_recovery_spec
import Theorems.Thm_Couret_STROBO2TORS_recoh_representative_checked_decoder_eq_exact
import Definitions.Def_Couret_RecohSelectedDecoder_a1594570d3fe
import Definitions.Def_Couret_RecohParityOrbitRefinement_49bc5e3f0a8c
import Definitions.Def_Couret_RecohParitySelector_0eb69704c517
set_option autoImplicit false
/-!
Coefficient decoding from the compact parity family.
The generic bridge uses a proved cover modulo two-torsion, the historical
sign-recovery specification and the exact integer observation checker.
The new candidate construction is an image of the parity family, not the
historical edge-triple enumeration. Definitions enumerate neither G nor
its two-torsion subgroup. Complex values occur only in the specification.
-/
namespace Couret.STROBO2TORS
variable {G I J : Type*} [AddCommGroup G] [DecidableEq G]
local notation "H₂" => recohTorsionSubgroup (G := G) 2
variable [Fintype I]
theorem recoh_parity_coefficient_backend_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) :
recohParityCoefficientBackendDecoder U R half index e p k enc obsTerms =
recohExactDecoder bank (R, obs) := by sorry
section CyclicSelected
open scoped BigOperators
variable {d : ℕ} (q : Fin d → ℕ) [∀ i, NeZero (q i)]
end CyclicSelected
end Couret.STROBO2TORS