Every absolute error below one admits exact stable reconstruction
ProvedCouret.STROBO2TORS.recoh_stable_noisy_reconstructionLet with positive natural moduli . Write , for the ordered pair-sum count, and for its fibre among triples. For square entries , let be the computed stable bank, using the specified square-only odd-power binary multiplier selection and square-selected ternary coordinate, and let be its selected index type. Let , and . Put . Rational-complex centres are interpreted as complex numbers. For rational , put , . Call valid when , and . The stable noisy core generates one recovered candidate per cyclic square representative using binary signs, then filters by rational balls of radius around all predicted stable-bank readings. The guarded decoder first checks the typed square format and valid precision, returning the empty set if either fails. Let square entries satisfy the typed square format, let be a triple with , and let rational observations have coordinatewise error at most rational relative to the computed stable-bank readings of . Then
The approximation parameters are finite and their guards are part of the decoder.
import Aesop
import Definitions.Def_Couret_RecohStableReconstruction_da64f089b51e
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.Complex.Norm
import Mathlib.Analysis.Real.Pi.Bounds
import Mathlib.Analysis.SpecialFunctions.Complex.Arctan
import Mathlib.Analysis.SpecialFunctions.Complex.CircleAddChar
import Mathlib.Analysis.SpecialFunctions.Trigonometric.Bounds
import Mathlib.Analysis.SpecificLimits.Normed
import Mathlib.Data.Complex.Basic
import Mathlib.Data.Complex.BigOperators
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.Rat.Cast.Order
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.Linarith
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring
import Mathlib.Tactic.Tauto
import Mathlib.Topology.Algebra.Order.Floor
import Theorems.Thm_Couret_STROBO2TORS_recoh_stable_noisy_core_singleton
import Theorems.Thm_Couret_STROBO2TORS_recoh_stable_precision_parameters_exist
import Theorems.Thm_Couret_STROBO2TORS_recoh_typed_square_format_check_iff
import Definitions.Def_Couret_RecohStableSquareSelection_4ccedec76589
import Definitions.Def_Couret_RecohStableBank_b01db9b053a3
import Definitions.Def_Couret_RecohNoisySignRecovery_25d41afc9bfe
import Definitions.Def_Couret_RecohRationalRoots_2e1442988636
set_option autoImplicit false
/-!
End-to-end stable reconstruction on explicit cyclic products. The square
determines the bank, rational series determine the prediction centres, and
the decoder generates at most one candidate per square representative.
Precision is supplied by two natural numbers and checked by rational guards.
No complex comparison occurs in the executable definitions.
-/
namespace Couret.STROBO2TORS
open scoped BigOperators
variable {d : ℕ} (q : Fin d → ℕ) [∀ i, NeZero (q i)]
theorem recoh_stable_noisy_reconstruction
(entries : List (((i : Fin d) → ZMod (q i)) × ℕ))
(hformat : RecohTypedSquareFormat entries)
(S : Finset ((i : Fin d) → ZMod (q i))) (hS : S.card = 3)
(hR : orderedSquare S = recohTypedSquareValue entries)
(observed : RecohSelectedBankIndex q entries → RecohRationalComplex)
(epsilon : ℚ) (he0 : 0 ≤ epsilon) (he1 : epsilon < 1)
(hobs : ∀ i, ‖recohRationalComplexValue (observed i) -
recohSupportProbe (recohComputedStableBank q entries i) S‖ ≤ (epsilon : ℝ)) :
∃ machinTerms taylorTerms,
RecohStablePrecisionValid epsilon machinTerms taylorTerms ∧
recohStableNoisyDecoder q entries observed epsilon machinTerms taylorTerms = {S} := by sorry
end Couret.STROBO2TORS