Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Canonical tuple counters exactly represent ordered squares

Proved
Couret.STROBO2TORS.recoh_canonical_counter_equal_iff

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

couret-programmecouret-unification-20261108

Let d∈Nd\in\mathbb Nd∈N, let q0,…,qd−1q_0,\ldots,q_{d-1}q0​,…,qd−1​ be positive integers, and put G=∏j<dZ/qjZG=\prod_{j<d}\mathbb Z/q_j\mathbb ZG=∏j<d​Z/qj​Z. Let L,ML,ML,M be duplicate-free lists of canonical coordinate tuples, and let S,TS,TS,T be their encoded supports in GGG. The canonical counter counts all ordered pair sums as canonical tuples. Then

Counter⁡(L)=Counter⁡(M)⟺QS=QT.\operatorname{Counter}(L)=\operatorname{Counter}(M)\Longleftrightarrow Q_S=Q_T.Counter(L)=Counter(M)⟺QS​=QT​.

This transports equality of executable counters to the group-theoretic square data.

Preamble
import Aesop
import Definitions.Def_Couret_RecohCanonicalRepresentations_728d443f1366
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 Definitions.Def_Couret_RecohTypedObservation_b23b2e33136b
import Definitions.Def_Couret_RecohCyclicPrimaryBank_92b8732c410a

set_option autoImplicit false

/-!
Canonical numeric points and ordered counters for the Python v0.2 boundary.

A typed point has one natural coordinate strictly below each nonzero modulus.
The maps below construct the correspondence with the product of `ZMod`s;
no interpretation hypothesis is supplied by a caller.  The arithmetic is the
modular arithmetic used by `_add`, `_sub`, and `_double`.  The list counter
counts all ordered pairs, including the diagonal and repeated resulting sums.

This module does not model Python objects, tuple sorting, JSON parsing,
exceptions, or execution of the Python interpreter.  In particular, the
no-duplicate hypothesis on a support is essential when a list is replaced by
a finite set.
-/

namespace Couret.STROBO2TORS

section Coordinates

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



































end Coordinates

section ListCounters

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























end ListCounters

section CanonicalCounters

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













Formal statement

theorem recoh_canonical_counter_equal_iff
    (xs ys : List (RecohCanonicalPoint q)) (hxs : xs.Nodup) (hys : ys.Nodup) :
    recohCanonicalCounter q xs = recohCanonicalCounter q ys ↔
      orderedSquare (xs.map (recohPointEncode q)).toFinset =
        orderedSquare (ys.map (recohPointEncode q)).toFinset := by sorry


end CanonicalCounters

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/RecohCanonicalRepresentations.lean, lines 264–283; source file SHA-256 316b02d78efff655bcc676d7681a06d198da79e90c819ec51ee6c7d5bb423e8e; theorem Couret.STROBO2TORS.recoh_canonical_counter_equal_iff

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