Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Anchored deduplication preserves the parity representative cover

Proved
Couret.STROBO2TORS.recoh_parity_dedup_cover

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

couret-programmecouret-unification-20261108

Let GGG be an abelian group, RS(z)R_S(z)RS​(z) the ordered pair-sum count of a support SSS, Pχ(S)=∑s∈Sχ(s)P_\chi(S)=\sum_{s\in S}\chi(s)Pχ​(S)=∑s∈S​χ(s), and F(S)={T:∣T∣=3,RT=RS}F(S)=\{T:|T|=3,R_T=R_S\}F(S)={T:∣T∣=3,RT​=RS​}. Put H=G[2]H=G[2]H=G[2]. Let UUU contain the nonzero support of R:G→NR:G\to\mathbb NR:G→N and let hhh be a sound and complete partial halving solver. Let LLL enumerate exactly the specified parity representatives for (U,R,h)(U,R,h)(U,R,h), and let an anchor map choose a point of each entry of LLL. Let DDD be the finite set of its anchored orbit-deduplicated list. Then

B∈D⟹∣B∣=3∧RB=R,B\in D\Longrightarrow|B|=3\land R_B=R,B∈D⟹∣B∣=3∧RB​=R, ∣S∣=3, RS=R⟹∃B∈D,∃u∈H, S=B+u.|S|=3,\ R_S=R\Longrightarrow\exists B\in D,\exists u\in H,\ S=B+u.∣S∣=3, RS​=R⟹∃B∈D,∃u∈H, S=B+u.

No finiteness of GGG is required.

Preamble
import Aesop
import Definitions.Def_Couret_RecohParityOrbitRefinement_49bc5e3f0a8c
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_anchored_dedup_coverage
import Theorems.Thm_Couret_STROBO2TORS_recoh_anchored_dedup_mem_source
import Definitions.Def_Couret_RecohParityGenerator_deb90a4bb68d
import Definitions.Def_Couret_RecohCompactOrbitBridge_59017063a1ce

set_option autoImplicit false

/-!
Composition of the parity generator with the historical orbit construction.

The equality below is an equality of finite families of entire H-orbits,
not equality of representatives or their iteration order. Deduplication is
applied to an explicit list enumeration of the parity representatives. The
list and its anchors are inputs with stated representation contracts; no
classical `Finset.toList` is hidden in an executable definition.
-/

namespace Couret.STROBO2TORS

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



Formal statement
omit [Fintype G] in

theorem recoh_parity_dedup_cover
    (U : Finset G) (R : G → ℕ) (half : G → Option G)
    (hhalf : RecohHalfSolverSpec half) (hR : ∀ z, R z ≠ 0 → z ∈ U)
    (xs : List (Finset G))
    (hxs : xs.toFinset = recohParityRepresentatives U R half)
    (anchor : Finset G → G) (hanchor : ∀ B ∈ xs, anchor B ∈ B) :
    RecohParityCover R (recohAnchoredOrbitDedup anchor xs).toFinset := by sorry




section Cyclic

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









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/RecohParityOrbitRefinement.lean, lines 34–60; source file SHA-256 185cc0d31c6488113857d44700e65389fdc92fe2ab3f45b213f4e762f52ee979; theorem Couret.STROBO2TORS.recoh_parity_dedup_cover

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