Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A matching of evaluations yields zero relation rows

Proved
Couret.InterIA.SingletonNecessity.matching_rows_zero

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

couret-programmecouret-unification-20261108

Let GGG be an abelian group, x:{0,…,5}→Gx:\{0,\ldots,5\}\to Gx:{0,…,5}→G, and Ex(v)=∑ivixiE_x(v)=\sum_i v_i x_iEx​(v)=∑i​vi​xi​ on Z6\mathbb Z^6Z6. Let L,RL,RL,R be lists of vectors whose evaluation lists are permutations. There exists a list ppp permuting 0,…,∣R∣−10,\ldots,|R|-10,…,∣R∣−1 such that

Ex(v−Rpj)=0for each paired (v,pj)∈zip⁡(L,p).E_x(v-R_{p_j})=0\quad\text{for each paired }(v,p_j)\in\operatorname{zip}(L,p).Ex​(v−Rpj​​)=0for each paired (v,pj​)∈zip(L,p).

The statement allows empty lists and repeated evaluated values.

Preamble
import Definitions.Def_Couret_CertificateSoundness_1059e04412f7
import Definitions.Def_Couret_ExtractionBasics_37ec1603f738
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.BigOperators.Ring.Finset
import Mathlib.Algebra.Group.Pi.Basic
import Mathlib.Data.Finset.Insert
import Mathlib.Data.Finset.Prod
import Mathlib.Data.Finset.SymmDiff
import Mathlib.Data.Fintype.Pi
import Mathlib.Data.Int.Basic
import Mathlib.Data.List.Permutation
import Mathlib.Data.ZMod.Basic
import Mathlib.Tactic.Abel
import Mathlib.Tactic.FinCases
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Ring
import Mathlib.Tactic.Tauto
import Theorems.Thm_Couret_InterIA_SingletonNecessity_permutation_indices
import Theorems.Thm_Couret_InterIA_SingletonNecessity_zip_mapped_eq
import Definitions.Def_Couret_CertificateSoundness_1059e04412f7
import Definitions.Def_Couret_ExtractionBasics_37ec1603f738

set_option autoImplicit false
namespace Couret.InterIA.SingletonNecessity
variable {G : Type*} [AddCommGroup G] [DecidableEq G]



Formal statement
theorem matching_rows_zero (x : Fin 6 → G) (L R : List Vec)
    (hp : (L.map (evaluation x)).Perm (R.map (evaluation x))) :
    ∃ p : List ℕ, p.Perm (List.range R.length) ∧
      ∀ v ∈ ((L.zip p).map fun (v,j) => v-R[j]!), evaluation x v=0 := by sorry






end Couret.InterIA.SingletonNecessity
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 source-tree/research/interia/abelian-singleton-necessity-20261104/formal/MatchingEncoding.lean, lines 20–37; source file SHA-256 a0d826191571fb63dcc640fefffc281719b6b20eb83cbb257aa021d20bf19b83; theorem Couret.InterIA.SingletonNecessity.matching_rows_zero

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