Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Parity-matched doubles admit cross or mixed normal labels

Proved
Couret.InterIA.SingletonNecessity.parity_relabel

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

couret-programmecouret-unification-20261108

Let GGG be an abelian group, and let x0,…,x5∈Gx_0,\ldots,x_5\in Gx0​,…,x5​∈G be such that 0,x0,…,x50,x_0,\ldots,x_50,x0​,…,x5​ are pairwise distinct. Put A={0,x0,x1,x2}A=\{0,x_0,x_1,x_2\}A={0,x0​,x1​,x2​}, B={0,x3,x4,x5}B=\{0,x_3,x_4,x_5\}B={0,x3​,x4​,x5​}, L=[x0,x1,x2,x0+x1,x0+x2,x1+x2]L=[x_0,x_1,x_2,x_0+x_1,x_0+x_2,x_1+x_2]L=[x0​,x1​,x2​,x0​+x1​,x0​+x2​,x1​+x2​], and R=[x3,x4,x5,x3+x4,x3+x5,x4+x5]R=[x_3,x_4,x_5,x_3+x_4,x_3+x_5,x_4+x_5]R=[x3​,x4​,x5​,x3​+x4​,x3​+x5​,x4​+x5​]. Assume that for each zzz, the number of indices i<3i<3i<3 with 2xi=z2x_i=z2xi​=z and the number of indices 3≤i<63\le i<63≤i<6 with 2xi=z2x_i=z2xi​=z have the same parity. Then one can choose y0,…,y5y_0,\ldots,y_5y0​,…,y5​ with 0,y0,…,y50,y_0,\ldots,y_50,y0​,…,y5​ pairwise distinct and unchanged left and right supports, such that

(2y0=2y3, 2y1=2y4, 2y2=2y5)or(2y0=2y1, 2y3=2y4, 2y2=2y5).(2y_0=2y_3,\ 2y_1=2y_4,\ 2y_2=2y_5)\quad\text{or}\quad(2y_0=2y_1,\ 2y_3=2y_4,\ 2y_2=2y_5).(2y0​=2y3​, 2y1​=2y4​, 2y2​=2y5​)or(2y0​=2y1​, 2y3​=2y4​, 2y2​=2y5​).

This reduces all parity matchings to two canonical patterns.

Preamble
import Definitions.Def_Couret_ExtractionBasics_37ec1603f738
import Definitions.Def_Couret_RelabelBasics_a474d20b9d5f
import Definitions.Def_Couret_SixDoublePairing_42d09f1cbb6a
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_parity_has_pairing
import Theorems.Thm_Couret_InterIA_SingletonNecessity_sevenDistinct_reindex
import Theorems.Thm_Couret_InterIA_SingletonNecessity_supportLeft_reindex
import Theorems.Thm_Couret_InterIA_SingletonNecessity_supportRight_reindex
import Definitions.Def_Couret_RelabelBasics_a474d20b9d5f
import Definitions.Def_Couret_ExtractionBasics_37ec1603f738
import Definitions.Def_Couret_SixDoublePairing_42d09f1cbb6a

set_option autoImplicit false
set_option linter.unusedSimpArgs false
namespace Couret.InterIA.SingletonNecessity
open Finset Couret.InterIA.Parity
variable {G : Type*} [AddCommGroup G] [DecidableEq G]

Formal statement
theorem parity_relabel (x : Fin 6 → G) (hd : SevenDistinct x)
    (hp : FibreParity (fun i => x i+x i)) :
    ∃ y : Fin 6 → G, SevenDistinct y ∧ supportLeft y=supportLeft x ∧
      supportRight y=supportRight x ∧ (CrossDoubles y ∨ MixedDoubles y) := 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/ParityRelabel.lean, lines 10–135; source file SHA-256 e38c100083df9eeb8ec0d544ff8ea7bc62af4aac0fcd7a4c8a30c69d9cc7593a; theorem Couret.InterIA.SingletonNecessity.parity_relabel

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