Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Parity deduplication preserves the selected ternary coordinate

Proved
Couret.STROBO2TORS.recoh_parity_dedup_ternary_choice_eq_legacy

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

couret-programmecouret-unification-20261108

Let d≥0d\ge0d≥0, let qiq_iqi​ be nonzero natural numbers for i<di<di<d, and set A=∏i<dZ/qiA=\prod_{i<d}\mathbb Z/q_iA=∏i<d​Z/qi​. A primary coordinate for a prime ppp is an index with p∣qip\mid q_ip∣qi​. For supports in AAA, write QSQ_SQS​ for ordered-sum counts, Pχ(S)=∑x∈Sχ(x)P_\chi(S)=\sum_{x\in S}\chi(x)Pχ​(S)=∑x∈S​χ(x), and OB(S)=(QS,(Pχi(S))i)\mathcal O_B(S)=(Q_S,(P_{\chi_i}(S))_i)OB​(S)=(QS​,(Pχi​​(S))i​) for a character bank BBB. For typed square entries EEE on AAA, let xxx be a list whose finite-set contents equal the cyclic parity representatives. Let an anchor choose a point of each member of xxx. Then the ternary choice computed from its anchored deduplication equals the legacy square-selected ternary choice:

Choice⁡(dedup⁡(x))=SquareChoice⁡(E).\operatorname{Choice}(\operatorname{dedup}(x))=\operatorname{SquareChoice}(E).Choice(dedup(x))=SquareChoice(E).

No input-format premise is needed.

Preamble
import Aesop
import Definitions.Def_Couret_RecohParitySelector_0eb69704c517
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.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.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_parity_dedup_cover
import Theorems.Thm_Couret_STROBO2TORS_recoh_parity_dedup_orbit_families_eq_legacy
import Definitions.Def_Couret_RecohParityOrbitRefinement_49bc5e3f0a8c

set_option autoImplicit false

/-!
Transport of the conditional ternary selector to the parity representatives.

A ternary observation is constant on each two-torsion orbit. Consequently
both the one-orbit predicate and every separating-coordinate predicate
depend only on the finite family of orbits. Scanning the same coordinate
order therefore returns exactly the same first coordinate, even when the
representatives or their deduplication order differ.

The definitions below concern typed mathematical inputs. They do not
identify Python list order, parsing, exceptions, or execution semantics.
-/

namespace Couret.STROBO2TORS

section FiniteFamilies

variable {G : Type*} [AddCommGroup G] [DecidableEq G] [Fintype G]







end FiniteFamilies

section Cyclic

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



























Formal statement

theorem recoh_parity_dedup_ternary_choice_eq_legacy
    (entries : List (((i : Fin d) → ZMod (q i)) × ℕ))
    (xs : List (Finset ((i : Fin d) → ZMod (q i))))
    (hxs : xs.toFinset = recohCyclicParityRepresentatives q entries)
    (anchor : Finset ((i : Fin d) → ZMod (q i)) → ((i : Fin d) → ZMod (q i)))
    (hanchor : ∀ B ∈ xs, anchor B ∈ B) :
    recohTernaryChoiceFromRepresentatives q (recohAnchoredOrbitDedup anchor xs).toFinset =
      recohSquareTernaryChoice q entries := by sorry


end Cyclic

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/RecohParitySelector.lean, lines 224–250; source file SHA-256 c17657a92d6caa292995c99fb93b4623634d6b4d95a8fae5ba6263e804ec456a; theorem Couret.STROBO2TORS.recoh_parity_dedup_ternary_choice_eq_legacy

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