Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A ternary triple encoding reduces to at most six terms

Proved
Couret.STROBO2TORS.recoh_cyclic_ternary_candidate_terms_le_six

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

couret-programmecouret-unification-20261108

Let qjq_jqj​ be arbitrary natural moduli, let iii index an active ternary coordinate of the specified cyclic bank, and let S⊆∏j<dZ/qjZS\subseteq\prod_{j<d}\mathbb Z/q_j\mathbb ZS⊆∏j<d​Z/qj​Z have size three. For any natural depth kkk,

∣ReducedTerms⁡3,k(encode⁡i(S))∣≤6.|\operatorname{ReducedTerms}_{3,k}(\operatorname{encode}_i(S))|\le6.∣ReducedTerms3,k​(encodei​(S))∣≤6.

The moduli need not be nonzero for this length bound; repeated terms are counted before canonical combination.

Preamble
import Aesop
import Definitions.Def_Couret_RecohCyclicCoefficientDecoder_9d7602a6d6c9
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.Multiset.Sort
import Mathlib.Data.Nat.Factorization.Basic
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_cyclic_bank_encoding_length
import Theorems.Thm_Couret_STROBO2TORS_recoh_reduced_terms_length_le
import Definitions.Def_Couret_RecohCyclicCoefficientDecoder_9d7602a6d6c9

set_option autoImplicit false

/-!
The bank actually indexed by the typed cyclic decoder attains the minimal
measurement budget, including its empty bank on odd-order products.
The short-term bounds below apply to candidate triples. No length bound
is imposed on arbitrary externally supplied coefficient observations.
-/

namespace Couret.STROBO2TORS

open scoped BigOperators

variable {d : ℕ} (q : Fin d → ℕ) [∀ i, NeZero (q i)]













Formal statement
omit [∀ i, NeZero (q i)] in
theorem recoh_cyclic_ternary_candidate_terms_le_six
    (i : RecohActiveTernaryCoordinate q)
    (S : Finset ((i : Fin d) → ZMod (q i))) (hS : S.card = 3)
    (k : ℕ) :
    (recohReducedTerms 3 k (recohCyclicBankEncoding q (Sum.inr i) S)).length ≤ 6 := 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/RecohCyclicDecoderOptimal.lean, lines 101–110; source file SHA-256 b9a6a9f00591eaed0b13b93930156abd42380859ca93bd38dd62091f8d615fb4; theorem Couret.STROBO2TORS.recoh_cyclic_ternary_candidate_terms_le_six

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