Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A mixed matching has a permutation encoding

Proved
Couret.InterIA.SingletonNecessity.mixed_encoding

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

couret-programmecouret-unification-20261108

Let GGG be an abelian group and x:{0,…,5}→Gx:\{0,\ldots,5\}\to Gx:{0,…,5}→G satisfy the mixed-double relations. Suppose the left sum list followed by 2x02x_02x0​ is a permutation of the right sum list followed by 2x32x_32x3​. There is a permutation list ppp of 0,…,60,\ldots,60,…,6 with

v(x)=0(v∈Rmixed(p)).v(x)=0\qquad(v\in\mathcal R_{\mathrm{mixed}}(p)).v(x)=0(v∈Rmixed​(p)).

This encodes the augmented seven-term matching. The mixed double constraints are 2x0=2x12x_0=2x_12x0​=2x1​, 2x3=2x42x_3=2x_42x3​=2x4​, 2x2=2x52x_2=2x_52x2​=2x5​. The unaugmented sum lists are the three entries and their three pair sums in each block (0,1,2)(0,1,2)(0,1,2) and (3,4,5)(3,4,5)(3,4,5).

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_evaluation_basis
import Theorems.Thm_Couret_InterIA_SingletonNecessity_matching_rows_zero
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 mixed_encoding (x : Fin 6 → G) (hx : MixedDoubles x)
    (hp : (sumTermsLeft x ++ [x 0+x 0]).Perm (sumTermsRight x ++ [x 3+x 3])) :
    ∃ p : List ℕ, p.Perm (List.range 7) ∧
      ∀ v ∈ relations true p, 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 71–103; source file SHA-256 a0d826191571fb63dcc640fefffc281719b6b20eb83cbb257aa021d20bf19b83; theorem Couret.InterIA.SingletonNecessity.mixed_encoding

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